SCI和EI收录∣中国化工学会会刊

Chinese Journal of Chemical Engineering ›› 2018, Vol. 26 ›› Issue (8): 1727-1735.DOI: 10.1016/j.cjche.2018.06.008

• Selected Papers from the 28th Chinese Process Control Conference • 上一篇    下一篇

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

Kunkun Peng, Quanke Pan, Biao Zhang   

  1. State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
  • 收稿日期:2017-10-11 修回日期:2018-06-01 出版日期:2018-08-28 发布日期:2018-09-21
  • 通讯作者: Quanke Pan,E-mail addresses:panquanke@hust.edu.cn
  • 作者简介:Kunkun Peng,E-mail addresses:pengkunkun@126.com;Biao Zhang,E-mail addresses:zhangbiao1218@gmail.com
  • 基金资助:

    Supported by the National Natural Science Foundation of China (51705177, 51575212), the Program for New Century Excellent Talents in University (NCET-13-0106), and the Program for HUST Academic Frontier Youth Team.

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

Kunkun Peng, Quanke Pan, Biao Zhang   

  1. State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
  • Received:2017-10-11 Revised:2018-06-01 Online:2018-08-28 Published:2018-09-21
  • Contact: Quanke Pan,E-mail addresses:panquanke@hust.edu.cn
  • Supported by:

    Supported by the National Natural Science Foundation of China (51705177, 51575212), the Program for New Century Excellent Talents in University (NCET-13-0106), and the Program for HUST Academic Frontier Youth Team.

摘要: 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 accepted with 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.

关键词: Artificial bee colony, Steelmaking-refining-continuous casting, Hybrid flowshop scheduling, Variable neighborhood search

Abstract: 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 accepted with 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.

Key words: Artificial bee colony, Steelmaking-refining-continuous casting, Hybrid flowshop scheduling, Variable neighborhood search