Genetic algorithm for solving printed circuit board assembly planning problems

Ming C. Leu, Hermean Wong, Zhiming Ji

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations

Abstract

A new application of the genetic algorithm approach is introduced to solved 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 two 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.

Original languageEnglish (US)
Pages1579-1586
Number of pages8
StatePublished - Dec 1 1992
EventProceedings of the 1992 Japan - USA Symposium on Flexible Automation Part 2 (of 2) - San Francisco, CA, USA
Duration: Jul 13 1992Jul 15 1992

Other

OtherProceedings of the 1992 Japan - USA Symposium on Flexible Automation Part 2 (of 2)
CitySan Francisco, CA, USA
Period7/13/927/15/92

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Genetic algorithm for solving printed circuit board assembly planning problems'. Together they form a unique fingerprint.

Cite this