文献类型：期刊文献

英文题名：Imperialist competitive algorithm for assembly sequence planning

作者：Zhou, Wei[1];Yan, Jianjun[1];Li, Yong[1];Xia, Chunming[1];Zheng, Jianrong[1]

机构：[1]E China Univ Sci & Technol, Coll Mech & Power Engn, Shanghai 200237, Peoples R China

年份：2013

卷号：67

期号：9-12

起止页码：2207

外文期刊名：INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY

收录：;EI(收录号：20140217170893);WOS:【SCI-EXPANDED(收录号:WOS:000322326300020)】；

语种：英文

外文关键词：Imperialist competitive algorithm; Assembly sequence planning; Optimization

摘要：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.