Adaptive Genetic Algorithm for Optimal Printed Circuit Board Assembly Planning

Document Type

Article

Publication Date

1-1-1993

Abstract

We present a novel application of the genetic algorithm approach for solving the problem of planning optimal placement/insertion sequence and machine setup in primed circuit board (PCB) assembly. The algorithm starts with feasible solutions and utilizes genetic operators to iteratively generate potentially better solutions in the optimization process, similar to the biological evolution process. We first describe the basic algorithm and its application to optimal planning for some popular PCB assembly machines. We then describe an adaptive genetic algorithm, which has its rates of genetic operators changed automatically during the iterative optimization process. We use a Wilcoxon signed rank test to show its performance improvement over the fixed-rate genetic algorithm. © 1993 CIRP.

Identifier

0027187275 (Scopus)

Publication Title

CIRP Annals Manufacturing Technology

External Full Text Location

https://doi.org/10.1016/S0007-8506(07)62382-8

e-ISSN

17260604

ISSN

00078506

First Page

17

Last Page

20

Issue

1

Volume

42

This document is currently not available here.

Share

COinS