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 条
  • [41] An effective artificial bee colony algorithm for the flexible job-shop scheduling problem
    Wang, Ling
    Zhou, Gang
    Xu, Ye
    Wang, Shengyao
    Liu, Min
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 60 (1-4) : 303 - 315
  • [42] The Improved Simulated Annealing Genetic Algorithm for Flexible Job-Shop Scheduling Problem
    Gu, Xiaolin
    Huang, Ming
    Liang, Xu
    PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 22 - 27
  • [43] Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem
    Gutierrez, Celia
    Garcia-Magarino, Ivan
    KNOWLEDGE-BASED SYSTEMS, 2011, 24 (01) : 102 - 112
  • [44] Solving the Flexible Job Shop Scheduling Problem Based on Memetic Algorithm
    Zhang, Guohui
    ADVANCES IN PRODUCT DEVELOPMENT AND RELIABILITY III, 2012, 544 : 1 - 5
  • [45] An Improved Genetic Algorithm for Solving Flexible Job shop Scheduling Problem
    Zhou Wei
    Bu Yan-ping
    Zhou Ye-qing
    2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 4553 - 4558
  • [46] A modified genetic algorithm approach to flexible job shop scheduling problem
    Saidi-Mehrabad, M.
    Bagheri, M.
    2015 3RD INTERNATIONAL CONFERENCE ON MANUFACTURING ENGINEERING AND TECHNOLOGY FOR MANUFACTURING GROWTH (METMG 2015), 2015, : 138 - 142
  • [47] A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
    Al Aqel, Ghiath
    Li, Xinyu
    Gao, Liang
    CHINESE JOURNAL OF MECHANICAL ENGINEERING, 2019, 32 (01)
  • [48] Evolutional Algorithm in Solving Flexible Job Shop Scheduling Problem with Uncertainties
    Zheng, Yahong
    Lian, Lian
    Fu, Zaifeng
    Mesghouni, Khaled
    LISS 2013, 2015, : 1009 - 1015
  • [49] A Hybrid Cooperative Coevolution Algorithm for Fuzzy Flexible Job Shop Scheduling
    Sun, Lu
    Lin, Lin
    Gen, Mitsuo
    Li, Haojie
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2019, 27 (05) : 1008 - 1022
  • [50] A hybrid genetic algorithm with a neighborhood function for flexible job shop scheduling
    Meziane, Mohammed El-Amine
    Taghezout, Noria
    MULTIAGENT AND GRID SYSTEMS, 2018, 14 (02) : 161 - 175
12345