A Discrete Particle Swarm Optimization Approach to Optimize the Assembly Sequence of Mechanical Product

Abstract:

The aim of assembly sequence planning (ASP) is to achieve the best assembly sequence which assembly cost and time used is less. The geometrical feasibility of an assembly sequence is validated by the interference matrix of the product. The number of assembly tool changes and the number of assembly operation type changes are considered in the fitness function. To establish the mapping relation between ASP and particle swarm optimization (PSO) approach, some definitions of position, velocity and operator of particles are proposed. The difference of the proposed discrete PSO (DPSO) algorithm with the other algorithm is the emphasis on the geometrical feasibility of the assembly sequence. The geometrical feasibility is verified at the first and the every iteration. The performance and feasibility of the proposed algorithm is verified via a simplified engine assembly case.

• Periodical: Advanced Materials Research (Volumes 490-495)
• Pages: 203-207
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.490-495.203
• Online since: March 2012
• Authors: Zhong Bo Zhang, Chuan Yong Huang
• Keywords: Assembly Sequence Planning, Discrete Particle Swarm Optimization, Geometrical Feasibility

References

[1] Bonneville F, Perrard C, Henrioud, J M. A genetic algorithm to generate and evaluate assembly plans. IEEE Symposium on Emerging Technology and Factory Automation, Paris, France, 1995, 2: 231–239.

DOI: 10.1109/etfa.1995.496663

[2] Lazzerini B, Marcelloni F. A genetic algorithm for generating optimal assembly plans. Artif Intell Eng, 2000, 14: 319–329.

DOI: 10.1016/s0954-1810(00)00011-x

[3] Wang J F, Liu J H, Zhong Y F. A novel ant colony algorithm for assembly sequence planning [J]. Advanced Manufacturing Technology, 2005, 25(11): 1137- 1143.

DOI: 10.1007/s00170-003-1952-z

[4] Cem S, Borklu H R. An assembly sequence planning system for mechanical parts using neural network [J]. Assembly Automation, 2005, 25(1): 38- 43.

DOI: 10.1108/01445150510578996

[5] Chen Y M, Lin C T. A particle swarm optimization approach to optimize component placement in printed circuit board assembly. Int J Adv Manuf Technol, 2007, 35: 610–620.

DOI: 10.1007/s00170-006-0777-y

[6] Zhan Z H, Zhang J. Discrete particle swarm optimization for multiple destination routing problems, Applications of Evolutionary Computing, EvoWorkshops 2009, LNCS 5484: 117–122.

DOI: 10.1007/978-3-642-01129-0_15

[7] Liu B, Wang L, Jin YH, An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst Man Cybern, Part B Cybern, 2007, 37(1): 18–27.

DOI: 10.1109/tsmcb.2006.883272

[8] Dini G, Santochi M, Automated sequencing and subassembly detection in assembly planning. CIRP Ann, 1992, 41(1): 1–4.

DOI: 10.1016/s0007-8506(07)61140-8

[9] Hong Guang Lv, Cong Lu. An assembly sequence planning approach with a discrete particle swarm optimization algorithm. Int J Adv Manuf Technol, 2010, 50: 761–770.

DOI: 10.1007/s00170-010-2519-4