Balanced Adaptive Tabu Search Algorithm to Optimize Dual-gantry Pick-and-place Assembly
2017
Abstract This paper presents an optimization study of dual-gantry high-speed rotary-type pick-and-place surface mount device (SMD) machine. In the dual-gantry SMD machine, there are two feeder bases and gantry heads, such that two placement heads can pick-and-place synchronously in one PCB, which has an advantage in assembly PCB with more component types. The dual-gantry optimization problem is decomposed into nozzle arrangement, feeder assignment, pick-and-place sequence, component allocation, and gantry schedule problems. To balance the workload between gantries and reduce the wait time in the gantry's synchronous movement, a balanced adaptive tabu search (BATS) algorithm is proposed. Based on the 16 industrial data tests, the proposed algorithm yields a 7.04% improvement on average compared to the industrial package.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
1
Citations
NaN
KQI