An optimization algorithm of PCB assembly time for multi-head placement machine

2017 
This paper studies the optimization problem of PCB assembly time for multi-head placement machine. Mathematical model is built and analyzed for the problem, which is of a combinatorial nature and computationally intractable. An optimization algorithm based on heuristic strategy and scatter search method is proposed to minimize the PCB assembly time. By relaxing the restrictions on the problem, the algorithm reduces the assembly time by minimizing cycles of pick-and-place, constructing the simultaneous pickups and optimizing sequence of pick-and-place of components. Numerical experiments were conducted to evaluate the proposed algorithm, along with a comparison with a heuristic algorithm (HA) under strong constraints proposed in existed literature. The results show that the proposed algorithm has better performance in optimization results and can shorten PCB assembly time of multi-head placement machine effectively.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    8
    References
    0
    Citations
    NaN
    KQI
    []