Genetic algorithm for solving printed circuit board assembly planning problems

Document Type

Conference Proceeding

Publication Date

12-1-1992

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.

Identifier

0027099115 (Scopus)

Publication Title

Flexible Automation 1992

First Page

1579

Last Page

1586

This document is currently not available here.

Share

COinS