Back to search

NJIT

Genetic algorithm for solving printed circuit board assembly planning problems

Abstract

dc:description.abstract

<p>The application of the genetic algorithm for solving the planning problems for various printed circuit board assembly machines is presented. The genetic algorithm finds the sequence of component placement/insertion and arrangement of feeders simultaneously, for achieving the shortest assembly time. Three types of assembly planning problems are modeled such that they can be solved by the genetic algorithm. The algorithm uses links (parents) to represent possible solutions and applies genetic operators to generate new links (offspring) in an iterative procedure to obtain the optimal solution. Some examples are provided to illustrate the solutions generated by the genetic algorithm, and these solutions are compared with those from other planning methods. A changing operation rate method is presented for the algorithm improvement.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science in Mechanical Engineering - (M.S.)
Discipline thesis:degree_discipline
Mechanical and Industrial Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wong, Hermean
Contributors dc:contributor
  • M. C. Leu
  • Nouri Levy
  • MengChu Zhou

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/2654

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wong, Hermean. Genetic algorithm for solving printed circuit board assembly planning problems. https://digitalcommons.njit.edu/theses/2654