关键词: 元件贴装顺序问题, 贴片机, 遗传算法, 印刷电路板

Abstract: Component placement sequence problems are critical problems determining the surface mounting machines efficiency. A genetic algorithm (GA) is applied to solve them for gantry machines. The GA has its special chromosome coding, chromosome encoding and crossover operator. The chromosome of individual has one or several links, which depends on the assembled printed circuit board. One gene of a chromosome represents one pick-and-place cycle. Experiment results show that the GA can resolve the problem effectively. At the same time, A performance comparison between three traditional crossover operaters and the crossover operator are presented and analyzed. The results show that the traditional crossover operators cannot solve the problems effectively.

Key words: component placement sequence problem, surface mounting machine, genetic algorithm, printed circuit board