A Hybrid Imperialist Competitive Algorithm for the Flexible Job Shop Problem

被引：6
|
作者：
Ghasemishabankareh, Behrooz [1 ]
Shahsavari-Pour, Nasser [2 ]
Basiri, Mohammad-Ali [3 ]
Li, Xiaodong [1 ]
机构：
[1] RMIT Univ, Sch Comp Sci & IT, Melbourne, Vic, Australia
[2] Vali E Asr Univ, Dept Ind Management, Rafsanjan, Iran
[3] Islamic Azad Univ, Dept Ind Engn, Sci & Res Branch, Kerman, Iran
来源：
ARTIFICIAL LIFE AND COMPUTATIONAL INTELLIGENCE, ACALCI 2016 | 2016年 / 9592卷
关键词：
Flexible job shop scheduling problem; Imperialist competitive algorithm; Genetic algorithm; Simulated annealing algorithm; Taguchi parameter design; DEPENDENT SETUP TIMES; SCHEDULING PROBLEMS; GENETIC ALGORITHM; OPTIMIZATION; HYBRIDIZATION; TARDINESS; MECHANISM;
D O I：
10.1007/978-3-319-28270-1_19
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Flexible job shop scheduling problem (FJSP) is one of the hardest combinatorial optimization problems known to be NP-hard. This paper proposes a novel hybrid imperialist competitive algorithm with simulated annealing (HICASA) for solving the FJSP. HICASA explores the search space by using imperial competitive algorithm (ICA) and use a simulated annealing (SA) algorithm for exploitation in the search space. In order to obtain reliable results from HICASA algorithm, a robust parameter design is applied. HICASA is compared with the widely-used genetic algorithm (GA) and the relatively new imperialist competitive algorithm (ICA). Experimental results suggest that HICASA algorithm is superior to GA and ICA on the FJSP.
引用
收藏
页码：221 / 233
页数：13
相关论文
共 50 条
  • [1] An Effective Hybrid Imperialist Competitive Algorithm and Tabu Search for an Extended Flexible Job Shop Scheduling Problem
    Lunardi, Willian Tessaro
    Voos, Holger
    Cherri, Luiz Henrique
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 204 - 211
  • [2] An Imperialist Competitive Algorithm for a Real-World Flexible Job Shop Scheduling Problem
    Lunardi, Willian Tessaro
    Voos, Holger
    Cherri, Luiz Henrique
    2018 IEEE 23RD INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2018, : 402 - 409
  • [3] Solving the job shop scheduling problem using the imperialist competitive algorithm
    Zhang, Jie
    Zhang, Peng
    Yang, Jianxiong
    Huang, Ying
    FRONTIERS OF ADVANCED MATERIALS AND ENGINEERING TECHNOLOGY, PTS 1-3, 2012, 430-432 : 737 - +
  • [4] A hybrid imperialist competitive algorithm for energy-efficient flexible job shop scheduling problem with variable-size sublots
    Li, Yibing
    Yang, Zipeng
    Wang, Lei
    Tang, Hongtao
    Sun, Libo
    Guo, Shunsheng
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 172
  • [5] An imperialist competitive algorithm for energy-efficient flexible job shop scheduling
    Guo, Jiong
    Lei, Deming
    PROCEEDINGS OF THE 33RD CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2021), 2021, : 5145 - 5150
  • [6] An Imperialist Competitive Algorithm for the Job Shop Scheduling Problems
    Piroozfard, H.
    Wong, K. Y.
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 69 - 73
  • [7] Novel imperialist competitive algorithm for many-objective flexible job shop scheduling
    Li M.
    Lei D.-M.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2019, 36 (06): : 893 - 901
  • [8] Multi-objective Flexible Job Shop Scheduling Problem with Energy Consumption Constraint Using Imperialist Competitive Algorithm
    Guo, Chengzhi
    Lei, Deming
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I, 2018, 10954 : 659 - 669
  • [9] An Imperialist Competitive Algorithm With the Diversified Operators for Many-Objective Scheduling in Flexible Job Shop
    Li, Ming
    Lei, Deming
    Xiong, Hejin
    IEEE ACCESS, 2019, 7 : 29553 - 29562
  • [10] A Hybrid Algorithm for Flexible Job-shop Scheduling Problem
    Tang, Jianchao
    Zhang, Guoji
    Lin, Binbin
    Zhang, Bixi
    CEIS 2011, 2011, 15
12345