Abstract
Assembly sequence planning (ASP) becomes one of the major challenges in the product design and manufacturing. A good assembly sequence leads in reducing the cost and time of the manufacturing process. However, assembly sequence planning is known as a classical hard combinatorial optimization problem. Assembly sequence planning with more product components becomes more difficult to be solved. In this paper, an approach based on a new variant of Particle Swarm Optimization Algorithm (PSO) called the multi-state of Particle Swarm Optimization (MSPSO) is used to solve the assembly sequence planning problem. As in of Particle Swarm Optimization Algorithm, MSPSO incorporates the swarming behaviour of animals and human social behaviour, the best previous experience of each individual member of swarm, the best previous experience of all other members of swarm, and a rule which makes each assembly component of each individual solution of each individual member is occurred once based on precedence constraints and the best feasible sequence of assembly is then can be determined. To verify the feasibility and performance of the proposed approach, a case study has been performed and comparison has been conducted against other three approaches based on Simulated Annealing (SA), Genetic Algorithm (GA), and Binary Particle Swarm Optimization (BPSO). The experimental results show that the proposed approach has achieved significant improvement.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
De Mello, L.S.H., Arthur, C.D.: A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans. Robot. Autom. 7, 228–240 (1991)
Zhang, W.: Representation of assembly and automatic robot planning by petri net. IEEE Trans. Syst. Man. Cybern. 19, 418–422 (1989)
Lee, S., Shin, Y.G.: Assembly planning based on geometric reasoning. Comput. Graph. 14, 237–250 (1990)
Moore, E.K., Aşkıner, G., Surendra, M.G.: Petri net approach to disassembly process planning for products with complex and/or precedence relations. Eur. J. Oper. Res. 135, 428–449 (2001)
Zha, X.F.: An object-oriented knowledge based petri net approach to intelligent integration of design and assembly planning. Artif. Intell. Eng. 14, 83–112 (2000)
Garrod, W., Everett, L.J.: Automated sequential assembly planner. In: ASME International Computers in Engineering Conference, pp. 139–150. Texas A&M University, Boston (1990)
Chakrabarty, S., Wolter, J.: A structure-oriented approach to assembly sequence planning. IEEE Trans. Robot. Autom. 13, 14–29 (1997)
Hong, D.S., Cho, H.S.: A neural network based computation scheme for generating optimized robotic assembly sequences. Eng. Appl. Artif. Intell. 8, 129–145 (1995)
Chen, W.C., Tai, P.H., Deng, W.J., Hsieh, L.F.: A three-stage integrated approach for assembly sequence planning using neural networks. Expert Syst. Appl. 34, 1777–1786 (2008)
Huang, H.H., Wang, M.H., Johnson, M.R.: Disassembly sequence generation using a neural network approach. J. Manuf. Syst. 19, 73–82 (2000)
Bonneville, F., Perrard, C., Henrioud, J.M.: A genetic algorithm to generate and evaluate assembly plans. In: IEEE Symposium on Emerging Technologies and Factory Automation, pp. 231–239. IEEE Press, Paris (1995)
Choi, Y.K., Lee, D.M., Cho, Y.B.: An approach to multi-criteria assembly sequence planning using genetic algorithms. Int. J. Adv. Manuf. Technol. 42, 180–188 (2008)
De, L., Latinne, P., Rekiek, B.: Assembly planning with an ordering genetic algorithm. Int. J. Prod. Res. 39, 3623–3640 (2001)
Lu, C., Wong, Y.S., Fuh, J.Y.H.: An enhanced assembly planning approach using a multi-objective genetic algorithm. Proc. Inst. Mech. Eng. B J. Eng. Manuf. 220, 255–272 (2006)
Marian, R.M., Luong, L.H.S., Abhary, K.: Assembly sequence planning and optimization using genetic algorithms: part I. automatic generation of feasible assembly sequences. Appl. Soft Comput. 2, 223–253 (2003)
Tseng, Y.J., Yu, F.Y., Huang, F.Y.: A multi-plant assembly sequence planning model with integrated assembly sequence planning and plant assignment using GA. Int. J. Adv. Manuf. Technol. 48, 333–345 (2010)
Zhou, W., Zheng, J.R., Yan, J.J., Wang, J.F.: A novel hybrid algorithm for assembly sequence planning combining bacterial chemotaxis with genetic algorithm. Int. J. Adv. Manuf. Technol. 52, 715–724 (2011)
Milner, J.M., Graves, S.C., Whitney, D.E.: Using simulated annealing to select least-cost assembly sequences. In: IEEE International Conference on Robotics and Automation, pp. 2058–2063. IEEE Press, California (1994)
Motavalli, S., Islam, A.: Multi-criteria assembly sequencing. Comput. Ind. Eng. 32, 743–751 (1997)
Wang, J.F., Liu, J.H., Zhong, Y.F.: A novel ant colony algorithm for assembly sequence planning. Int. J. Adv. Manuf. Technol. 25, 1137–1143 (2005)
Gao, L., Qian, W.R., Li, X.Y., Wang, J.F.: Application of memetic algorithm in assembly sequence planning. Int. J. Adv. Manuf. Technol. 49, 1175–1184 (2010)
Guo, Y.W., Li, W.D., Mileham, A.R., Owen, G.W.: Applications of particle swarm optimization in integrated process planning and scheduling. Robot. Comput. Integr. Manuf. 25, 280–288 (2009)
Mukred, J.A.A., Ibrahim, Z., Ibrahim, I., Adam, A., Wan, K., Yusof, Z.M., Mokhtar, N.: A binary particle swarm optimization approach to optimize assembly sequence planning. Adv. Sci. Lett. 13, 732–738 (2012)
Tseng, Y.J., Yu, F.Y., Huang, F.Y.: A green assembly sequence planning model with a closed-loop assembly and disassembly sequence planning using a particle swarm optimization method. Int. J. Adv. Manuf. Technol. 57, 1183–1197 (2011)
Cheng, H., Li, Y., Zhang, K.F.: Efficient method of assembly sequence planning based on GA and optimizing by assembly path feedback for complex product. Int. J. Adv. Manuf. Technol. 42, 1187–1204 (2009)
Li, M., Wu, B., Hu, Y., Jin, C., Shi, T.: A hybrid assembly sequence planning approach based on discrete particle swarm optimization and evolutionary direction operation. Int. J. Adv. Manuf. Technol. 68, 617–630 (2013)
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35, 268–308 (2003)
Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Press, Perth (1995)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104–4108. IEEE Press, Florida (1997)
Ibrahim, I., Ahmad, H., Ibrahim, Z., Jusoh, M.F.M., Yusof, Z.M., Nawawi, S.W., Khalil, K., Rahim, M.A.A.: Multi-state particle swarm optimization for discrete combinatorial optimization problem. Int. J. Simulat. Sys. Sci. Technol. 15, 15–25 (2014)
Acknowledgement
This work is financially supported by the Ministry of Higher Education Malaysia through the Fundamental Research Grant Scheme (FRGS) VOT RDU140114 granted to Universiti Malaysia Pahang.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Ibrahim, I., Ibrahim, Z., Ahmad, H., Yusof, Z.M. (2016). An Assembly Sequence Planning Approach with a Multi-state Particle Swarm Optimization. In: Fujita, H., Ali, M., Selamat, A., Sasaki, J., Kurematsu, M. (eds) Trends in Applied Knowledge-Based Systems and Data Science. IEA/AIE 2016. Lecture Notes in Computer Science(), vol 9799. Springer, Cham. https://doi.org/10.1007/978-3-319-42007-3_71
Download citation
DOI: https://doi.org/10.1007/978-3-319-42007-3_71
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42006-6
Online ISBN: 978-3-319-42007-3
eBook Packages: Computer ScienceComputer Science (R0)