Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times

2017 ◽  
Vol 55 (20) ◽  
pp. 6145-6157 ◽  
Author(s):  
Imène Benkalai ◽  
Djamal Rebaine ◽  
Caroline Gagné ◽  
Pierre Baptiste
Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1661
Author(s):  
Dayong Han ◽  
Qiuhua Tang ◽  
Zikai Zhang ◽  
Zixiang Li

Steelmaking and the continuous-casting (SCC) scheduling problem is a realistic hybrid flow shop scheduling problem with continuous-casting production at the last stage. This study considers the SCC scheduling problem with diverse products, which is a vital and difficult problem in steel plants. To tackle this problem, this study first presents the mixed-integer linear programming (MILP) model to minimize the objective of makespan. Then, an improved migrating birds optimization algorithm (IMBO) is proposed to tackle this considered NP-hard problem. In the proposed IMBO, several improvements are employed to achieve the proper balance between exploration and exploitation. Specifically, a two-level decoding procedure is designed to achieve feasible solutions; the simulated annealing-based acceptance criterion is employed to ensure the diversity of the population and help the algorithm to escape from being trapped in local optima; a competitive mechanism is developed to emphasize exploitation capacity by searching around the most promising solution space. The computational experiments demonstrate that the proposed IMBO obtains competing performance and it outperforms seven other implemented algorithms in the comparative study.


Sign in / Sign up

Export Citation Format

Share Document