Adaptive Genetic Algorithm for Optimal Printed Circuit Board Assembly Planning

CIRP Annals ◽  
1993 ◽  
Vol 42 (1) ◽  
pp. 17-20 ◽  
Author(s):  
H. Wong ◽  
M.C. Leu
1993 ◽  
Vol 115 (4) ◽  
pp. 424-432 ◽  
Author(s):  
M. C. Leu ◽  
H. Wong ◽  
Z. Ji

A new application of the genetic algorithm approach is introduced to solve printed circuit board assembly planning problems. The developed genetic algorithm finds the sequence of component placement/insertion and the arrangement of feeders simultaneously, for achieving the shortest assembly time, for three main types of assembly machines. The algorithm uses links (parents) to represent possible solutions and it applies genetic operators to generate new links (offspring) in an iterative procedure to obtain nearly optimal solutions. Examples are provided to illustrate solutions generated by the algorithm.


Sign in / Sign up

Export Citation Format

Share Document