Imperialist competitive algorithm for assembly sequence planning

被引：21
|
作者：
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
来源：
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2013年 / 67卷 / 9-12期
关键词：
Imperialist competitive algorithm; Assembly sequence planning; Optimization; GENERATION;
D O I：
10.1007/s00170-012-4641-y
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：2207 / 2216
页数：10
相关论文
共 50 条
  • [1] Imperialist competitive algorithm for assembly sequence planning
    Wei Zhou
    Jianjun Yan
    Yong Li
    Chunming Xia
    Jianrong Zheng
    [J]. The International Journal of Advanced Manufacturing Technology, 2013, 67 : 2207 - 2216
  • [2] Imperialist Competitive Algorithm for AUV Path Planning in a Variable Ocean
    Zeng, Zheng
    Sammut, Karl
    Lammas, Andrew
    He, Fangpo
    Tang, Youhong
    [J]. APPLIED ARTIFICIAL INTELLIGENCE, 2015, 29 (04) : 402 - 420
  • [3] Integrated process planning and scheduling using an imperialist competitive algorithm
    Lian, Kunlei
    Zhang, Chaoyong
    Gao, Liang
    Li, Xinyu
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (15) : 4326 - 4343
  • [4] Optimization of process planning with various flexibilities using an imperialist competitive algorithm
    Kunlei Lian
    Chaoyong Zhang
    Xinyu Shao
    Liang Gao
    [J]. The International Journal of Advanced Manufacturing Technology, 2012, 59 : 815 - 828
  • [5] The Comparison of Imperialist Competitive Algorithm Applied and Genetic Algorithm for Machining Allocation of Clutch Assembly
    Towsyfyan, H.
    Adnani-Salehi, S. A.
    Ghayyem, M.
    Mosaedi, F.
    [J]. INTERNATIONAL JOURNAL OF ENGINEERING, 2013, 26 (12): : 1485 - 1493
  • [6] Optimization of process planning with various flexibilities using an imperialist competitive algorithm
    Lian, Kunlei
    Zhang, Chaoyong
    Shao, Xinyu
    Gao, Liang
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 59 (5-8): : 815 - 828
  • [7] An imperialist competitive algorithm for a mixed-model assembly line sequencing problem
    Moradi, Hadi
    Zandieh, M.
    [J]. JOURNAL OF MANUFACTURING SYSTEMS, 2013, 32 (01) : 46 - 54
  • [8] A genetic algorithm for assembly sequence planning
    Del Valle, C
    Gasca, RM
    Toro, M
    Camacho, EF
    [J]. ARTIFICIAL NEURAL NETS PROBLEM SOLVING METHODS, PT II, 2003, 2687 : 337 - 344
  • [9] Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm
    Bagher, M.
    Zandieh, M.
    Farsijani, H.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 54 (1-4): : 271 - 285
  • [10] Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm
    M. Bagher
    M. Zandieh
    H. Farsijani
    [J]. The International Journal of Advanced Manufacturing Technology, 2011, 54 : 271 - 285
12345