TY - GEN
T1 - Generation of optimal assembly sequences using particle swarm optimization
AU - Liu, Jihong
AU - Wang, Yong
AU - Gu, Zhicai
PY - 2008
Y1 - 2008
N2 - Assembly sequence planning of complex products is apt to get into a hobble of combinatorial explosion because of large numbers of parts. Contrasted with the conventional methods, intelligent algorithms reveal their advantages in throwing off the vexatious situations. This paper presents a particle swarm optimization (PSO) approach to tackle the generation of optimal assembly sequences of complex products. Six kinds of assembly process constraints related to the assembly cost are analyzed at first. Then, an optimization model of assembly sequences is constructed. The mapping rules between the optimization model and the PSO model are clarified. The common operators in PSO algorithm are transformed into the velocity operators (VOs), which are used to adjust the orders of parts to generate the optimal assembly sequences. The proposed method is validated with an illustrative example and the solutions are compared with those obtained using simulated annealing (SA) algorithm under the same conditions.
AB - Assembly sequence planning of complex products is apt to get into a hobble of combinatorial explosion because of large numbers of parts. Contrasted with the conventional methods, intelligent algorithms reveal their advantages in throwing off the vexatious situations. This paper presents a particle swarm optimization (PSO) approach to tackle the generation of optimal assembly sequences of complex products. Six kinds of assembly process constraints related to the assembly cost are analyzed at first. Then, an optimization model of assembly sequences is constructed. The mapping rules between the optimization model and the PSO model are clarified. The common operators in PSO algorithm are transformed into the velocity operators (VOs), which are used to adjust the orders of parts to generate the optimal assembly sequences. The proposed method is validated with an illustrative example and the solutions are compared with those obtained using simulated annealing (SA) algorithm under the same conditions.
UR - https://www.scopus.com/pages/publications/77958097912
U2 - 10.1115/DETC2008-49443
DO - 10.1115/DETC2008-49443
M3 - 会议稿件
AN - SCOPUS:77958097912
SN - 9780791843291
T3 - Proceedings of the ASME Design Engineering Technical Conference
SP - 11
EP - 18
BT - ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC/CIE2008
T2 - ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC/CIE2008
Y2 - 3 August 2008 through 6 August 2008
ER -