574
Views
74
Downloads
7
Crossref
N/A
WoS
7
Scopus
N/A
CSCD
A chip mounter is the core equipment in the production line of the surface-mount technology, which is responsible for finishing the mount operation. It is the most complex and time-consuming stage in the production process. Therefore, it is of great significance to optimize the load balance and mounting efficiency of the chip mounter and improve the mounting efficiency of the production line. In this study, according to the specific type of chip mounter in the actual production line of a company, a maximum and minimum model is established to minimize the maximum cycle time of the chip mounter in the production line. The production efficiency of the production line can be improved by optimizing the workload scheduling of each chip mounter. On this basis, a hybrid adaptive optimization algorithm is proposed to solve the load scheduling problem of the mounter. The hybrid algorithm is a hybrid of an adaptive genetic algorithm and the improved ant colony algorithm. It combines the advantages of the two algorithms and improves their global search ability and convergence speed. The experimental results show that the proposed hybrid optimization algorithm has a good optimization effect and convergence in the load scheduling problem of chip mounters.
A chip mounter is the core equipment in the production line of the surface-mount technology, which is responsible for finishing the mount operation. It is the most complex and time-consuming stage in the production process. Therefore, it is of great significance to optimize the load balance and mounting efficiency of the chip mounter and improve the mounting efficiency of the production line. In this study, according to the specific type of chip mounter in the actual production line of a company, a maximum and minimum model is established to minimize the maximum cycle time of the chip mounter in the production line. The production efficiency of the production line can be improved by optimizing the workload scheduling of each chip mounter. On this basis, a hybrid adaptive optimization algorithm is proposed to solve the load scheduling problem of the mounter. The hybrid algorithm is a hybrid of an adaptive genetic algorithm and the improved ant colony algorithm. It combines the advantages of the two algorithms and improves their global search ability and convergence speed. The experimental results show that the proposed hybrid optimization algorithm has a good optimization effect and convergence in the load scheduling problem of chip mounters.
F. J. Cazorla, P. M. W. Knijnenburg, R. Sakellariou, E. Fernandez, A. Ramirez, and M. Valero, Predictable performance in SMT processors: Synergy between the OS and SMTs, IEEE Trans. Comput., vol. 55, no. 7, pp. 785–799, 2006.
X. J. Lan, Y. Chen, and H. T. Tang, Balancing and continuous improvement of SMT production line, (in Chinese), Industrial Engineering and Management, vol. 11, no. 2, pp. 109–111, 2006.
M. Ayob and G. Kendall, A survey of surface mount device placement machine optimisation: Machine classification, Eur. J. Oper. Res., vol. 186, no. 3, pp. 893–914, 2008.
H. Y. Lin, C. J. Lin, and M. L. Huang, Optimization of printed circuit board component placement using an efficient hybrid genetic algorithm, Appl. Intell., vol. 45, no. 3, pp. 622–637, 2016.
W. Wang, P. C. Nelson, and T. M Tirpak, Optimization of high-speed multistation SMT placement machines using evolutionary algorithms, IEEE Trans. Electron. Packag. Manufact., vol. 22, no. 2, pp. 137–146, 1999.
W. Ho and P. Ji, An integrated scheduling problem of PCB components on sequential pick-and-place machines: Mathematical models and heuristic solutions, Expert Syst. Appl., vol. 36, no. 3, pp. 7002–7010, 2009.
O. Kulak, I. O. Yilmaz, and H. O. Günther, PCB assembly scheduling for collect-and-place machines using genetic algorithms, Int. J. Prod. Res., vol. 45, no. 17, pp. 3949–3969, 2007.
S. Y. Li, C. F. Hu, and F. H. Tian, Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms, Appl. Soft Comput., vol. 8, no. 1, pp. 522–529, 2008.
A. García-Nájera, C. A. Brizuela, and I. M. Martínez-Pérez, An efficient genetic algorithm for setup time minimization in PCB assembly, Int. J. Adv. Manuf. Technol., vol. 77, no. 5, pp. 973–989, 2015.
X. S. Yan, J. Sun, and C. Y. Hu, Research on contaminant sources identification of uncertainty water demand using genetic algorithm, Cluster Comput., vol. 20, no. 2, pp. 1007–1016, 2017.
X. S. Yan, H. M. Liu, Z. X. Zhu, and Q. H. Wu, Hybrid genetic algorithm for engineering design problems, Cluster Comput., vol. 20, no. 1, pp. 263–275, 2017.
C. H. Wu, D. Z. Wang, A. Ip, D. W. Wang, C. Y. Chan, and H. F. Wang, A particle swarm optimization approach for components placement inspection on printed circuit boards, J. Intell. Manuf., vol. 20, no. 5, pp. 535–549, 2009.
B. Wu, C. H. Qian, W. H. Ni, and S. H. Fan, The improvement of glowworm swarm optimization for continuous optimization problems, Expert Syst. Appl., vol. 39, no. 7, pp. 6335–6342, 2012.
Q. H. Wu, Z. X. Zhu, X. S. Yan, and W. Y. Gong, An improved particle swarm optimization algorithm for AVO elastic parameter inversion problem, Concurr. Comput.:Pract. Exper., vol. 31, no. 9, p. e4987, 2019.
W. Y. Gong and Z. H. Cai, Parameter extraction of solar cell models using repaired adaptive differential evolution, Solar Energy, vol. 94, pp. 209–220, 2013.
S. J. Li, W. Y. Gong, X. S. Yan, C. Y. Hu, D. Y. Bai, and L. Wang. Parameter estimation of photovoltaic models with memetic adaptive differential evolution, Solar Energy, vol. 190, pp. 465–474, 2019.
X. S. Yan, J. Zhao, C. Y. Hu, and D. Z. Zeng, Multimodal optimization problem in contamination source determination of water supply networks, Swarm Evol. Comput., vol. 47, pp. 66–71, 2019.
Y. J. Song, L. N. Xing, M. Y. Wang, Y. J. Yi, W. Xiang, and Z. S. Zhang, A knowledge-based evolutionary algorithm for relay satellite system mission scheduling problem, Comput. Ind. Eng., vol. 150, p. 106830, 2020.
J. W. Ou, J. H. Zheng, G. Ruan, Y. R. Hu, J. Zou, M. Q. Li, S. X. Yang, and X. Tan, A pareto-based evolutionary algorithm using decomposition and truncation for dynamic multi-objective optimization, Appl. Soft Comput., vol. 85, p. 105673, 2019.
S. J. Li, W. Y. Gong, X. S. Yan, C. Y. Hu, D. Y. Bai, L. Wang, and L. Gao, Parameter extraction of photovoltaic models using an improved teaching-learning-based optimization, Energy Convers. Manage., vol. 186, pp. 293–305, 2019.
X. S. Yan, P. P. Li, K. Tang, L. Gao, and L. Wang, Clonal selection based intelligent parameter inversion algorithm for prestack seismic data, Inf. Sci., vol. 517, pp. 86–99, 2020.
Y. J. Song, X. Ma, X. J. Li, L. N. Xing, and P. Wang, Learning-guided nondominated sorting genetic algorithm II for multi-objective satellite range scheduling problem, Swarm Evol. Comput., vol. 49, pp. 194–205, 2019.
P. F. Yu and X. S. Yan, Stock price prediction based on deep neural networks, Neural Comput. Appl., vol. 32, no. 6, pp. 1609–1628, 2020.
X. S. Yan, M. Z. Zhang, and Q. H. Wu, Big-data-driven pre-stack seismic intelligent inversion, Inf. Sci., vol. 549, pp. 34–52, 2021.
W. Y. Gong, Z. W. Liao, X. Y. Mi, L. Wang, and Y. Y. Guo, Nonlinear equations solving with intelligent optimization algorithms: A survey, Complex System Modeling and Simulation, vol. 1, no. 1, pp. 15–32, 2021.
Y. H. Du, L. Wang, L. N. Xing, J. G. Yan, and M. S. Cai, Data-driven heuristic assisted memetic algorithm for efficient inter-satellite link scheduling in the BeiDou navigation satellite system, IEEE/CAA J. Autom. Sin., vol. 8, no. 11, pp. 1800–1816, 2021.
S. Xiang, L. Wang, L. N. Xing, Y. H. Du, and Z. Q. Y. Zhang, Knowledge-based memetic algorithm for joint task planning of multi-platform earth observation system, Comput. Ind. Eng., vol. 160, p. 107559, 2021.
J. Y. Gong, X. S. Yan, and C. Y. Hu, An ensemble-surrogate assisted cooperative particle swarm optimisation algorithm for water contamination source identification, Int. J. Bio-Inspired Comput., vol. 19, no. 3, pp. 169–177, 2022.
C. Y. Hu, Q. M. Wang, W. Y. Gong, and X. S. Yan, Multi-objective deep reinforcement learning for emergency scheduling in a water distribution network, Memetic Comput., vol. 14, no. 2, pp. 211–223, 2022.
J. Han and Y. Seo, Mechanism to minimise the assembly time with feeder assignment for a multi-headed gantry and high-speed SMT machine, Int. J. Prod. Res., vol. 55, no. 10, pp. 2930–2949, 2017.
H. P. Hsu, Solving feeder assignment and component sequencing problems for printed circuit board assembly using particle swarm optimization, IEEE Trans. Autom. Sci. Eng., vol. 14, no. 2, pp. 881–893, 2017.
S. J. Guo, F. Geng, K. Takahashi, X. H. Wang, and Z. H. Jin, A MCVRP-based model for PCB assembly optimisation on the beam-type placement machine, Int. J. Prod. Res., vol. 57, no. 18, pp. 5874–5891, 2019.
M. Castellani, S. Otri, and D. T. Pham, Printed circuit board assembly time minimisation using a novel Bees algorithm, Comput. Ind. Eng., vol. 133, pp. 186–194, 2019.
J. S. Gao, X. M. Zhu, A. B. Liu, Q. Y. Meng, and R. T. Zhang, An iterated hybrid local search algorithm for pick-and-place sequence optimization, Symmetry, vol. 10, no. 11, p. 633, 2018.
D. B. Li, T. He, and S. W. Yoon, Clustering-based heuristic to optimize nozzle and feeder assignments for collect-and-place assembly, IEEE Trans. Autom. Sci. Eng., vol. 16, no. 2, pp. 755–766, 2019.
J. X. Luo, J. Y. Liu, and Y. M. Hu, An MILP model and a hybrid evolutionary algorithm for integrated operation optimisation of multi-head surface mounting machines in PCB assembly, Int. J. Prod. Res., vol. 55, no. 1, pp. 145–160, 2017.
D. B. Li and S. W. Yoon, PCB assembly optimization in a single gantry high-speed rotary-head collect-and-place machine, Int. J. Adv. Manuf. Technol., vol. 88, no. 9, pp. 2819–2834, 2017.
This paper was supported by the National Natural Science Foundation of China (Nos. U1911205, 62073300, and 62076225) and the National Key Research and Development Program of China (No. 2021YFB3301602).
The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).