Imperialist competitive algorithm for assembly sequence planning
- First Online:
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.
KeywordsImperialist competitive algorithm Assembly sequence planning Optimization
Unable to display preview. Download preview PDF.
- 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–1579Google 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/DAC5798Google Scholar
- 13.Chen SF, Liu Y (2001) The application of multi-level genetic algorithms in assembly planning. J Ind Technol 17(4):1–9Google 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 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–232Google Scholar
- 25.Cao PB, Xiao RB (2007) Assembly planning using a novel immune approach. Int J Adv Manuf Technol 31(7–8):770–782Google 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–4667Google 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–12Google 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 CongressGoogle Scholar
- 40.Sen S, Zhu G (1996) The optimal degree of outsourcing. J Financ Strateg Decis 9(3):63–70Google 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–74Google Scholar