TY - GEN
T1 - Dynamic Temperature Simulated Annealing Algorithm for the PCB Assembly Process
AU - Yang, Lilong
AU - Lu, Guangyu
AU - Bi, Yuhang
AU - Liu, Zhitai
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - The optimization performance of surface mount machines plays a critical role in determining the production efficiency of surface mount production lines. This article decomposes the surface mount machine optimization problem into two sub-problems, component assignment and feeder allocation. The mathematical models of these two problems are established, and a dynamic temperature simulated annealing (DTSA) algorithm is proposed to solve them. DTSA introduces a dynamic temperature adjustment mechanism that adaptively modifies the temperature parameters. This mechanism effectively addresses the exploration deficiency typically encountered in the later stages of simulated annealing (SA) while mitigating the risk of non-convergence caused by excessively high temperatures. Moreover, DTSA incorporates a convex hull greedy algorithm for calculating the distance during component assignment and feeder assignment solving. Experimental results demonstrate that DTSA significantly outperforms traditional algorithms, offers superior solution quality and faster convergence speed.
AB - The optimization performance of surface mount machines plays a critical role in determining the production efficiency of surface mount production lines. This article decomposes the surface mount machine optimization problem into two sub-problems, component assignment and feeder allocation. The mathematical models of these two problems are established, and a dynamic temperature simulated annealing (DTSA) algorithm is proposed to solve them. DTSA introduces a dynamic temperature adjustment mechanism that adaptively modifies the temperature parameters. This mechanism effectively addresses the exploration deficiency typically encountered in the later stages of simulated annealing (SA) while mitigating the risk of non-convergence caused by excessively high temperatures. Moreover, DTSA incorporates a convex hull greedy algorithm for calculating the distance during component assignment and feeder assignment solving. Experimental results demonstrate that DTSA significantly outperforms traditional algorithms, offers superior solution quality and faster convergence speed.
KW - component allocation
KW - feeder arrangement
KW - simulated annealing
KW - Surface mount optimization
UR - https://www.scopus.com/pages/publications/105017775504
U2 - 10.1109/FASTA65681.2025.11138635
DO - 10.1109/FASTA65681.2025.11138635
M3 - 会议稿件
AN - SCOPUS:105017775504
T3 - Proceedings of the 4th Conference on Fully Actuated System Theory and Applications, FASTA 2025
SP - 2426
EP - 2431
BT - Proceedings of the 4th Conference on Fully Actuated System Theory and Applications, FASTA 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 4th Conference on Fully Actuated System Theory and Applications, FASTA 2025
Y2 - 4 July 2025 through 6 July 2025
ER -