Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 5 / Issue 12

available in:   HTML (47 kB) PDF (923 kB) PS (563 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-005-12-0833

 

An Efficient Planning Algorithm for Multi-Head Surface Mounting Machines Using a Genetic Algorithm

Wonsik Lee (Seoul National University, Korea)

Sunghan Lee (Seoul National University, Korea)

Beom Hee Lee (Seoul National University, Korea)

Young Dae Lee (Semyung University, Korea)

Abstract: In this paper, a genetic algorithm based method is proposed to solve the problem of minimizing the PCB assembly time for multi-head surface mounting machines. By grouping the reels and by clustering the components the multi-head problem is transformed into a single_head one and then the single-head method is simply applied to the multi-head case. To implement the genetic algorithm, a partial link concept is proposed for genetic operations. Computer simulation results show that the proposed algorithm is superior to the heuristic algorithm that is currently used in industry.

Keywords: Genetic algorithm, PCB assembly time, multi-head surface mounting machine

Categories: H.4, I.6, J.6, J.7