The International Journal of Advanced Manufacturing Technology

, Volume 67, Issue 9, pp 2207–2216

Imperialist competitive algorithm for assembly sequence planning

Authors

  • Wei Zhou
    • College of Mechanical and Power EngineeringEast China University of Science and Technology
    • College of Mechanical and Power EngineeringEast China University of Science and Technology
  • Yong Li
    • College of Mechanical and Power EngineeringEast China University of Science and Technology
  • Chunming Xia
    • College of Mechanical and Power EngineeringEast China University of Science and Technology
  • Jianrong Zheng
    • College of Mechanical and Power EngineeringEast China University of Science and Technology
ORIGINAL ARTICLE

DOI: 10.1007/s00170-012-4641-y

Cite this article as:
Zhou, W., Yan, J., Li, Y. et al. Int J Adv Manuf Technol (2013) 67: 2207. doi:10.1007/s00170-012-4641-y

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.

Keywords

Imperialist competitive algorithmAssembly sequence planningOptimization

Copyright information

© Springer-Verlag London 2012