Skip to main content

Advertisement

Log in

Imperialist competitive algorithm for assembly sequence planning

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Automated generation of all feasible assembly sequences for a given product is highly desirable in manufacturing industry. Many research studies in the past decades described efforts to find more efficient algorithms for assembly sequence planning. Imperialist competitive algorithm for assembly sequence planning is presented in this paper. Population individuals called countries are in two types: colonies and imperialists that all together form some empires. Each assembly sequence is encoded into the country. The proposed algorithm is tested and compared with genetic algorithm and particle swarm optimization. Results show that imperialist competitive algorithm can improve the quality in solution searching and upgrade the opportunity to find optimal or near-optimal solution for assembly sequence planning.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Lai HY, Huang CT (2004) A systematic approach for automatic assembly sequence plan generation. Int J Adv Manuf Technol 24(9–10):752–763

    Article  Google Scholar 

  2. Shan HB, Li SX, Gong DG, Lou P (2006) Genetic simulated annealing algorithm-based assembly sequence planning. International Technology and Innovation Conference 2006 (ITIC 2006) CP 524, pp. 1573–1579

  3. Laperriere L, Eimafaghy H (1996) GAPP: a generative assembly process planner. J Manuf Syst 15(4):282–293

    Article  Google Scholar 

  4. Homem de Mello L, Lee S (1991) Computer-aided mechanical assembly planning. Kluwer Academic, London

    Book  Google Scholar 

  5. Dong TY, Tong RF, Zhang L, Dong JX (2007) A knowledge-based approach to assembly sequence planning. Int J Adv Manuf Technol 32(11–12):1232–1244

    Article  Google Scholar 

  6. Zha XF, Samuel YEL, Fok SC (1998) Integrated knowledge-based assembly sequence planning. Int J Adv Manuf Technol 14(1):50–64

    Article  Google Scholar 

  7. Hsu YY, Tai PH, Wang MW, Chen WC (2011) A knowledge-based engineering system for assembly sequence planning. Int J Adv Manuf Technol 55(5-8):763–782

    Article  Google Scholar 

  8. Lazzerini B, Marcelloni F (2000) A genetic algorithm for generating optimal assembly plans. Artif Intell Eng 14(4):319–329

    Article  MathSciNet  Google Scholar 

  9. Chen SF, Liu Y (2001) An adaptive genetic assembly sequence planner. Int J Comput Integr Manuf 14(5):489–500

    Article  Google Scholar 

  10. Smith GC, Smith SSF (2003) Automated initial population generation for genetic assembly planning. Int J Comput Integr Manuf 16(3):219–228

    Article  Google Scholar 

  11. Senin N, Groppetti R, Wallace DR (2000) Concurrent assembly planning with genetic algorithms. Robot Comput Integrated Manuf 16(4):65–72

    Article  Google Scholar 

  12. Chen SF (1998) Assembly planning-a genetic approach. Proceedings of the 24th ASME Design Automation Conference, Atlanta, Georgia, 12–16 September Paper no. DETC98/DAC5798

  13. Chen SF, Liu Y (2001) The application of multi-level genetic algorithms in assembly planning. J Ind Technol 17(4):1–9

    Google Scholar 

  14. Smith SSF (2004) Using multiple genetic operators to reduce premature convergence in genetic assembly planning. Comput Ind 54(1):35–49

    Article  Google Scholar 

  15. Choi YK, Lee DM, Cho YB (2009) An approach to multi-criteria assembly sequence planning using genetic algorithms. Int J Adv Manuf Technol 42(1–2):180–188

    Article  Google Scholar 

  16. Zhou W, Zheng JR, Yan JJ, Wang JF (2011) A novel hybrid algorithm for assembly sequence planning combining bacterial chemotaxis with genetic algorithm. Int J Adv Manuf Technol 52(5-8):715–724

    Article  Google Scholar 

  17. Hong DS, Cho HS (1995) A neural-network-based computational scheme for generating optimized robotic assembly sequence. Eng Appl Artif Intel 8(2):129–145

    Article  Google Scholar 

  18. Chen WC, Tai PH, Deng WJ, Hsieh LF (2008) A three-stage integrated approach for assembly sequence planning using neural networks. Expert Syst Appl 34(3):1777–1786

    Article  Google Scholar 

  19. Hong DS, Cho HS (1999) Generation of robotic assembly sequences using a simulated annealing. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Kyongju, Korea 2(2), pp. 1247–1252

  20. Motavalli S, Islam AU (1997) Multi-criteria assembly sequence. Comput Ind Eng 32(4):743–751

    Article  Google Scholar 

  21. Hong DS, Cho HS (1997) Generation of robotic assembly sequences with consideration of line balancing using simulated annealing. Robotica 15(6):663–673

    Article  Google Scholar 

  22. Failli F, Dini G (2000) Ant colony systems in assembly planning: a new approach to sequence detection and optimization. Proceedings of the 2nd CIRP international seminar on intelligent computation in manufacturing engineering, Capri, Italy, pp. 227–232

  23. Wang JF, Liu JH, Zhong YF (2005) A novel ant colony algorithm to assembly sequence planning. Int J Adv Manuf Technol 25(11–12):1137–1143

    Article  Google Scholar 

  24. Chang CC, Tseng HE, Meng LP (2009) Artificial immune systems for assembly sequence planning exploration. Eng Appl Artif Intel 22(8):1218–1232

    Article  Google Scholar 

  25. Cao PB, Xiao RB (2007) Assembly planning using a novel immune approach. Int J Adv Manuf Technol 31(7–8):770–782

    Google Scholar 

  26. Wang Y, Liu JH (2009) Chaotic particle swarm optimization for assembly sequence planning. Robot Cim-int Manuf 26(2):212–222

    Article  Google Scholar 

  27. Tseng YJ, Yu FY, Huang FY (2011) 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(9-12):1183–1197

    Article  Google Scholar 

  28. Lv HG, Lu C (2010) An assembly sequence planning approach with a discrete particle swarm optimization algorithm. Int J Adv Manuf Technol 50(5-8):761–770

    Article  Google Scholar 

  29. Gao L, Qian WR, Li XY, Wang JF (2010) Application of memetic algorithm in assembly sequence planning. Int J Adv Manuf Technol 49(9–12):1175–1184

    Article  Google Scholar 

  30. Rashid MFF, Hutabarat W, Tiwari A (2012) A review on assembly sequence planning and assembly line balancing optimisation using soft computing approaches. Int J Adv Manuf Technol 59(1-4):335–349

    Article  Google Scholar 

  31. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. IEEE Congr Evol Comput Singapore, pp. 4661–4667

  32. Atashpaz-Gargari E, Hashemzadeh F, Rajabioun R, Lucas C (2008) Colonial competitive algorithm, a novel approach for PID controller design in MIMO distillation column process. Int J Intell Comput Cybern 1(3):337–355

    Article  MathSciNet  Google Scholar 

  33. Kaveh A, Talatahari S (2010) Optimum design of skeletal structures using imperialist competitive algorithm. Comput Struct 88(21–22):1220–1229

    Article  Google Scholar 

  34. Duan HB, Xu CF, Liu SQ, Shao S (2010) Template matching using chaotic imperialist competitive algorithm. Pattern Recog Lett 31(13):1868–1875

    Article  Google Scholar 

  35. Nazari-Shirkouhi S, Eivazy H, Ghodsi R, Rezaie K, Atashpaz-Gargari E (2010) Solving the integrated product mix-outsourcing problem using the imperialist competitive algorithm. Expert Syst Appl 37(12):7615–7626

    Article  Google Scholar 

  36. Forouharfard S, Zandieh M (2010) An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems. Int J Adv Manuf Technol 51(9):1179–1193

    Article  Google Scholar 

  37. Biabangard-Oskouyi A, Atashpaz-Gargari E, Soltani N, Lucas C (2009) Application of imperialist competitive algorithm for materials property characterization from sharp indentation test. Int J Eng Simul 10(1):11–12

    Google Scholar 

  38. Rajabioun R, Atashpaz-Gargari E, Lucas C (2008) Colonial competitive algorithm as a tool for Nash equilibrium point achievement. Lect Notes Comput Sci 5073:680–695

    Article  Google Scholar 

  39. Rajabioun R, Hashemzadeh F, Atashpaz-Gargari E, Mesgari B, Rajaei Salmasi F (2008) Identification of a MIMO evaporator and its decentralized PID controller tuning using colonial competitive algorithm (pp. 11–12). IFAC World Congress

  40. Sen S, Zhu G (1996) The optimal degree of outsourcing. J Financ Strateg Decis 9(3):63–70

    Google Scholar 

  41. Galantucci LM, Percoco G, Spina R (2004) Assembly and disassembly planning by using fuzzy logic & genetic algorithms. Int J Adv Robot Syst 1(2):67–74

    Google Scholar 

  42. Dini G, Santochi M (1992) Automated sequencing and subassembly detection in assembly planning. Annals CIRP 41(1):1–4

    Article  Google Scholar 

  43. Huang YM, Huang CT (2002) Disassembly matrix for disassembly processes of products. Int J Prod Res 40(2):255–273

    Article  MATH  Google Scholar 

  44. Esmaeil AG, Hashemzadeh F, Rajabioun R (2008) Colonial competition algorithm: a novel approach for PID controller design in MIMO distillation column process. Int J Intell Comput Cybernet 1(3):337–355

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianjun Yan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, W., Yan, J., Li, Y. et al. Imperialist competitive algorithm for assembly sequence planning. Int J Adv Manuf Technol 67, 2207–2216 (2013). https://doi.org/10.1007/s00170-012-4641-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4641-y

Keywords

Navigation