Document Type
Thesis
Date of Award
5-31-1991
Degree Name
Master of Science in Mechanical Engineering - (M.S.)
Department
Mechanical and Industrial Engineering
First Advisor
M. C. Leu
Second Advisor
Nouri Levy
Third Advisor
MengChu Zhou
Abstract
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.
Recommended Citation
Wong, Hermean, "Genetic algorithm for solving printed circuit board assembly planning problems" (1991). Theses. 2654.
https://digitalcommons.njit.edu/theses/2654
