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 条
  • [31] A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
    Sun, Jinghe
    Zhang, Guohui
    Lu, Jiao
    Zhang, Wenqiang
    COMPUTERS & OPERATIONS RESEARCH, 2021, 132
  • [32] A Hybrid Variable Neighborhood Search Algorithm for Solving Multi-Objective Flexible Job Shop Problems
    Li, Jun-qing
    Pan, Quan-ke
    Xie, Sheng-xian
    COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2010, 7 (04) : 907 - 930
  • [33] A hybrid imperialist competitive algorithm for the outpatient scheduling problem with switching and preparation times
    Yu, Hui
    Li, Jun-qing
    Han, Yu-yan
    Sang, Hong-yan
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 1937 - 1942
  • [34] An Improved Imperialist Competitive Algorithm for Reentrant Flow Shop Scheduling
    Cheng, Yong
    Lei, Deming
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 2206 - 2211
  • [35] Hybrid Memetic Algorithm to Solve Multiobjective Distributed Fuzzy Flexible Job Shop Scheduling Problem with Transfer
    Yang, Jinfeng
    Xu, Hua
    PROCESSES, 2022, 10 (08)
  • [36] A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem
    Frutos, Mariano
    Carolina Olivera, Ana
    Tohme, Fernando
    ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) : 745 - 765
  • [37] A Collaborative Evolutionary Algorithm for Multi-objective Flexible Job Shop Scheduling Problem
    Li, X. Y.
    Gao, L.
    2011 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2011, : 997 - 1002
  • [38] Unified Genetic Algorithm Approach for Solving Flexible Job-Shop Scheduling Problem
    Park, Jin-Sung
    Ng, Huey-Yuen
    Chua, Tay-Jin
    Ng, Yen-Ting
    Kim, Jun-Woo
    APPLIED SCIENCES-BASEL, 2021, 11 (14):
  • [39] A hybrid evolutionary immune algorithm for fuzzy flexible job shop scheduling problem with variable processing speeds
    Chen, Xiao-long
    Li, Jun-qing
    Du, Yu
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 233
  • [40] Solving the Flexible Job Shop Scheduling Problem Based on Memetic Algorithm
    Zhang, Guohui
    ADVANCES IN PRODUCT DEVELOPMENT AND RELIABILITY III, 2012, 544 : 1 - 5
12345