An improved artificial bee colony algorithm for steelmaking-refining-continuous casting scheduling problem

被引:27
作者
Peng, Kunkun [1 ]
Pan, Quanke [1 ]
Zhang, Biao [1 ]
机构
[1] Huazhong Univ Sci & Technol, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Artificial bee colony; Steelmaking-refining-continuous casting; Hybrid flowshop scheduling; Variable neighborhood search; LAGRANGIAN-RELAXATION APPROACH; HYBRID FLOWSHOP; LOCAL SEARCH; TIMES;
D O I
10.1016/j.cjche.2018.06.008
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
Steelmaking-refining-Continuous Casting (SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. This paper develops an Improved Artificial Bee Colony (IABC) algorithm for the SCC scheduling. In the proposed IABC, charge permutation is employed to represent the solutions. In the population initialization, several solutions with certain quality are produced by a heuristic while others are generated randomly. Two variable neighborhood search neighborhood operators are devised to generate new high-quality solutions for the employed bee and onlooker bee phases, respectively. Meanwhile, in order to enhance the exploitation ability, a control parameter is introduced to conduct the search of onlooker bee phase. Moreover, to enhance the exploration ability, the new generated solutions are acceptedwith a control acceptance criterion. In the scout bee phase, the solution corresponding to a scout bee is updated by performing three swap operators and three insert operators with equal probability. Computational comparisons against several recent algorithms and a state-of-the-art SCC scheduling algorithm have demonstrated the strength and superiority of the IABC. (C) 2018 The Chemical Industry and Engineering Society of China, and Chemical Industry Press. All rights reserved.
引用
收藏
页码:1727 / 1735
页数:9
相关论文
共 37 条
[1]   An improved Lagrangian relaxation approach to scheduling steelmaking-continuous casting process [J].
Cui, Haijuan ;
Luo, Xiaochuan .
COMPUTERS & CHEMICAL ENGINEERING, 2017, 106 :133-146
[2]   A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization [J].
Cui, Laizhong ;
Li, Genghui ;
Zhu, Zexuan ;
Lin, Qiuzhen ;
Wen, Zhenkun ;
Lu, Nan ;
Wong, Ka-Chun ;
Chen, Jianyong .
INFORMATION SCIENCES, 2017, 414 :53-67
[3]   An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion [J].
Dong, Xingye ;
Huang, Houkuan ;
Chen, Ping .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1664-1669
[4]   A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems [J].
Gong, Dunwei ;
Han, Yuyan ;
Sun, Jianyong .
KNOWLEDGE-BASED SYSTEMS, 2018, 148 :115-130
[5]   Variable neighbourhood search: methods and applications [J].
Hansen, Pierre ;
Mladenovic, Nenad ;
Moreno Perez, Jose A. .
ANNALS OF OPERATIONS RESEARCH, 2010, 175 (01) :367-407
[6]   A soft-decision based two-layered scheduling approach for uncertain steelmaking-continuous casting process [J].
Hao, Jinghua ;
Liu, Min ;
Jiang, Shenglong ;
Wu, Cheng .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (03) :966-979
[7]   A decomposition approach for the scheduling of a steel plant production [J].
Harjunkoski, I ;
Grossmann, IE .
COMPUTERS & CHEMICAL ENGINEERING, 2001, 25 (11-12) :1647-1660
[8]   A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry [J].
Jiang, Shenglong ;
Liu, Min ;
Hao, Jinghua ;
Qian, Wangping .
COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 87 :518-531
[9]   A comprehensive survey: artificial bee colony (ABC) algorithm and applications [J].
Karaboga, Dervis ;
Gorkemli, Beyza ;
Ozturk, Celal ;
Karaboga, Nurhan .
ARTIFICIAL INTELLIGENCE REVIEW, 2014, 42 (01) :21-57
[10]   A comparative study of Artificial Bee Colony algorithm [J].
Karaboga, Dervis ;
Akay, Bahriye .
APPLIED MATHEMATICS AND COMPUTATION, 2009, 214 (01) :108-132