文献类型：期刊文献

中文题名：An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers

英文题名：An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers

作者：Zhang Su-jun[1,2];Gu Xing-sheng[2]

机构：[1]Henan Inst Sci & Technol, Sch Mech & Elect Engn, Xinxiang 453003, Peoples R China;[2]E China Univ Sci & Technol, Minist Educ, Key Lab Adv Control & Optimizat Chem Proc, Shanghai 200237, Peoples R China

年份：2015

卷号：22

期号：9

起止页码：3471

中文期刊名：Journal of Central South University

外文期刊名：JOURNAL OF CENTRAL SOUTH UNIVERSITY

收录：CSTPCD;;EI(收录号：20153701273882);Scopus;WOS:【SCI-EXPANDED(收录号:WOS:000360934000023)】；CSCD:【CSCD2015_2016】；

基金：Foundation item: 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

语种：英文

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

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

摘要：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.