An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers  

作　　者：张素君 顾幸生 

机构地区：[1]School of Mechanical and Electrical Engineering, Henan Institute of Science and Technology [2]Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology

出　　处：《Journal of Central South University》2015年第9期3471-3484,共14页中南大学学报（英文版）

基　　金：Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of China;Project(12JC1403400) supported by Shanghai Commission of Science and Technology,China;Project supported by the Fundamental Research Funds for the Central Universities,China

摘　　要：An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.An effective discrete artificial bee colony（DABC） algorithm is proposed for the flow shop scheduling problem with intermediate buffers（IBFSP） in order to minimize the maximum completion time（i.e makespan）. The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy（IG） algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.

关 键 词：discrete artificial bee colony algorithm flow shop scheduling problem with intermediate buffers destruction and construction tournament selection 

分 类 号：TB497[一般工业技术] TP18[自动化与计算机技术—控制理论与控制工程]