Imperialist competitive algorithm for assembly sequence planning

被引：22
|
作者：
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 条
  • [21] Application of memetic algorithm in assembly sequence planning
    Liang Gao
    Weirong Qian
    Xinyu Li
    Junfeng Wang
    The International Journal of Advanced Manufacturing Technology, 2010, 49 : 1175 - 1184
  • [22] A particle swarm algorithm for assembly sequence planning
    Xing, Yanfeng
    Wang, Yansong
    Zhao, Xiaoyu
    MANUFACTURING SCIENCE AND ENGINEERING, PTS 1-5, 2010, 97-101 : 3243 - 3246
  • [23] Multi-objective planning of electrical distribution system using Imperialist Competitive Algorithm
    Zheng, Ying
    Yang, Yonggang
    Yu, Guangming
    ADVANCES IN ENERGY SCIENCE AND EQUIPMENT ENGINEERING, 2015, : 1823 - 1828
  • [24] Application of memetic algorithm in assembly sequence planning
    Gao, Liang
    Qian, Weirong
    Li, Xinyu
    Wang, Junfeng
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 49 (9-12): : 1175 - 1184
  • [25] Imperialist competitive algorithm optimized artificial neural networks for UCAV global path planning
    Duan, Haibin
    Huang, Linzhi
    NEUROCOMPUTING, 2014, 125 : 166 - 171
  • [26] An Imperialist Competitive Algorithm based fuzzy clustering algorithm
    Teimouri, Mohammad
    Mehdizadeh, Esmaeil
    2013 13TH IRANIAN CONFERENCE ON FUZZY SYSTEMS (IFSC), 2013,
  • [27] A Sub-assembly Identification Algorithm for Assembly Sequence Planning
    Cao, Yan
    Kou, Xiaoxi
    Cao, Sen
    PROCEEDINGS OF THE 2015 INTERNATIONAL INDUSTRIAL INFORMATICS AND COMPUTER ENGINEERING CONFERENCE, 2015, : 555 - 558
  • [28] An improved imperialist competitive algorithm for global optimization
    You, Ting
    Hu, Yueli
    Li, Peijiang
    Tang, Yinggan
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2019, 27 (05) : 3567 - 3581
  • [29] A Hybrid Evolutionary Imperialist Competitive Algorithm (HEICA)
    Ramezani, Fatemeh
    Lotfi, Shahriar
    Soltani-Sarvestani, M. A.
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS (ACIIDS 2012), PT I, 2012, 7196 : 359 - 368
  • [30] Barrier coverage of WSNs with the imperialist competitive algorithm
    Habib Mostafaei
    Mohammad Shojafar
    Bahman Zaher
    Mukesh Singhal
    The Journal of Supercomputing, 2017, 73 : 4957 - 4980
12345