Optimizing Assembly Sequence Time Using Particle Swarm Optimization (PSO)

Article Preview

Abstract:

Assembly sequence planning (ASP) plays an important role in the production planning and should be optimized to minimize production time and cost when large numbers of parts and sub-assemblies are involved in the assembly process. Although the ASP problem has been tackled via a variety of optimization techniques, these techniques are often inefficient when applied to larger-scale problems. In this study, an approach using particle swarm optimization (PSO) is proposed to tackle one of the ASP problems which are optimizing the assembly sequence time. PSO uses a number of agents (particles) that constitute a swarm moving around in the search space looking for the best solution. Each bird, called particle, learns from its own best position and the globally best position. Experimental results show that PSO algorithm can produce good results in optimizing the assembly time, has a powerful global searching ability and fast rate of convergence.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

88-92

Citation:

Online since:

April 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Shan Hongbo, Li Shu-xia (2006), Genetic Simulated Annealing Algorithm-Based Assembly Sequence Planning,. Technology and Innovation Conference, 2006. Page(s): 1573 – 1579.

DOI: 10.1049/cp:20061017

Google Scholar

[2] Li Shu-xia, Shan Hong-bo (2008), GSSA and ACO for Assembly Sequence planning: A Comparative Study,. Automation and Logistics, 2008. IEEE International Conference. Page(s): 1270 – 1275.

DOI: 10.1109/ical.2008.4636347

Google Scholar

[3] Zhang et al. (2010), An Approach to Assembly Sequence Planning Using Ant Colony Optimization,. Intelligent Control and Information Processing (ICICIP), 2010 International Conference. Page(s): 230 – 233.

DOI: 10.1109/icicip.2010.5564298

Google Scholar

[4] Shan Hong-Bo, Li Shuxia (2008) The Comparison Between Genetic Simulated Annealing Algorithm and Ant Colony Optimization Algorithm for ASP,. WCNMCireless Communications, Networking and Mobile Computing, 2008. 4th International. Page(s): 1 – 6.

DOI: 10.1109/wicom.2008.2953

Google Scholar

[5] Hongguang Lv, Cong Lu (2009), A Discrete Particle Swarm Optimization Algorithm for Assembly Sequence Planning,. 8th International Conference. Page(s): 1119 – 1122.

DOI: 10.1109/icrms.2009.5270057

Google Scholar

[6] Young-Keun Choi et at. (2008), An Approach to Multi-Criteria Assembly Sequence Planning,. Int. J. Adv. Manuf. Technol. (2009). Page(s): 180 – 188.

Google Scholar