A multi-swarm fruit fly optimization algorithm to minimize makespan for the hybrid flowshop problem
详细信息 查看官网全文
- 英文论文题名：A multi-swarm fruit fly optimization algorithm to minimize makespan for the hybrid flowshop problem
- 论文作者：Junhua Duan ; Qingda Chen ; Weiqing Sun ; Quanke Pan
- 英文论文作者：Junhua Duan ; Qingda Chen ; Weiqing Sun ; Quanke Pan ; Computation Center ; Shanghai University ; State Key Laboratory of Synthetical Automation for Process Industries (Northeastern University) ; School of Mechatronic Engineering and Automation ; Shanghai University
- 年：2017
- 作者机构：Computation Center,Shanghai University;State Key Laboratory of Synthetical Automation for Process Industries (Northeastern University);School of Mechatronic Engineering and Automation,Shanghai University;
- 英文论文关键词：Evolutionary Algorithm ; Fruit Fly Optimization ; Hybrid Flowshop ; Makespan
- 会议召开时间：2017-07-26
- 会议录名称：第36届中国控制会议论文集（B）
- 英文会议录名称：Proceedings of the 36th Chinese Control Conference（B）
- 语种：英文
- 分类号：TB497;TP18
- 学会代码：KZLL
- 会议名称：第36届中国控制会议
- 会议地点：中国辽宁大连
- 主办单位：中国自动化学会控制理论专业委员会
- 学会名称：中国自动化学会控制理论专业委员会
- 页数：5
- 文件大小：170k
- 原文格式：D
- 会议级别：全国
摘要
This paper aims to minimize makespan for the hybrid flowshop scheduling problem. We present a novel Fruit Fly Optimization(FFO), called multi-swarm FFO, by introducing a multiple-swarm strategy and a competition-and-updating mechanism to the basic FFO. The parameters and operators for the presented MMFO algorithm are calibrated by means of a design of experiments approach. The numerical comparisons show that MFFO performs much better than several well-known metaheuristics in the literature for the considered HFS problem.
This paper aims to minimize makespan for the hybrid flowshop scheduling problem. We present a novel Fruit Fly Optimization(FFO), called multi-swarm FFO, by introducing a multiple-swarm strategy and a competition-and-updating mechanism to the basic FFO. The parameters and operators for the presented MMFO algorithm are calibrated by means of a design of experiments approach. The numerical comparisons show that MFFO performs much better than several well-known metaheuristics in the literature for the considered HFS problem.
This paper aims to minimize makespan for the hybrid flowshop scheduling problem. We present a novel Fruit Fly Optimization(FFO), called multi-swarm FFO, by introducing a multiple-swarm strategy and a competition-and-updating mechanism to the basic FFO. The parameters and operators for the presented MMFO algorithm are calibrated by means of a design of experiments approach. The numerical comparisons show that MFFO performs much better than several well-known metaheuristics in the literature for the considered HFS problem.
引文
[1]J.N.D.Gupta,Two-stage hybrid flowshop scheduling problem,Journal of the operational Research Society,39(4):359-364,1988.
[2]Y.D.Kim,B.J.Joo,J.H.Shin,Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ration constraint,Journal of Heuristics,15(1):19-42,2009.
[3]F.Riane,A.Artiba,S.E.Elmaghraby,A hybrid three-stage flexible flowshop problem:Efficient heuristics to minimize makespan,European Journal of Operational Research,109(2):321-329,1998.
[4]H.Soewandi,S.E.Elmaghraby,Sequencing three-stage flexible flowshops with identical machines to minimize makespan,IIE Transactions 33(11):985-993,2001.
[5]R.Ruiz,C.Maroto,A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility,European Journal of Operational Research,169(3):781-800,2006.
[6]M.Nawaz,E.E.J.Enscore,I.Ham,A heuristic algorithm for the m-machine,n-job flow shop sequencing problem,OMEGA,11(1):91-95,1983.
[7]C.D.Paternina-Arboleda,J.R.Montoya-torres,M.J.Acero-Dominguez,M.C.Herrera-Hernandez,Scheduling jobs on a k-stage flexible flow-shop,Annals of Operations Research,164(1):29-40,2008.
[8]E.Nowicki,C.Smutnick,The flow shop with parallel machines:A tabu search approach.European Journal of Operational Research,106(2-3):226-253,1998.
[9]O.Engin,A.Doyen,A new approach to solve hybrid flow shop scheduling problems by artificial immune system,Future Generation Computer Systems,20(6):1083-1095,2004.
[10]K.Alaykyran,O.Engin,A.Doyen,Using ant colony optimization to solve hybrid flow shop scheduling problems,International Journal of Advanced Manufacturing Technology,35(5):541-550,2007.
[11]C.Kahraman,O.Engin O,I.Kaya,M.K.Yilmaz,An application of effective genetic algorithms for solving hybrid flow shop scheduling problems,International Journal of Computational Intelligence Systems,1(2):134-147,2008.
[12]Z.Jin,Z.Yang,T.Ito,Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem,International Journal of Production Economics,100(2):322-334,2006.
[13]Q.Niu,T.Zhou,S.Ma,A quantum-inspired immune algorithm for hybrid flow shop with makespan criterion,Journal of Universal Computer Science,15(4):765-785,2009.
[14]C.J.Liao,E.Tjandradjaj,T.P.Chung,An approach using particle swarm optimization and bottleneck heuristic to solve flowshop scheduling problem,Applied Soft Computing,12(6):1755-1764,2012.
[15]Q.K.Pan,M.F.Tasgetiren,Y.C.Liang,A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem,Computers&Operations Research,35(9):2807-2839,2008.
[16]S.Khaloui,F.Ghedjati,A.Hamzaoui,A meta-heuristic approach to solve a JIT scheduling problem in hybrid flowshop,Engineering Applications of Artificial Intelligence,23(5):765-771,2010.
[17]J.Carlier,E.Neron,An exact method for solving the multiprocessor flowshop.RAIRO-Operations Research,34(1):1-25,2000.
[18]W.T.Pan,A new fruit fly optimization algorithm:taking the financial distress model,Knowledge-based Systems,26(2):69-74,2012.
[19]H.Li,S.Guo,C.Li,J.Sun,A hybrid annual power load forecasting model based on generalized regression neural network with fruit fly optimization algorithm,Knowledge-based Systems,37(2):378-387,2013.
[20]S.M.Lin,Analysis of service satisfaction in web auction logistics service using a combination of fruit fly optimization algorithm and general regression neural network,Neural Computing&Applications,22(3):783-791,2011.
[21]Q.-K.Pan,H.-Y.Sang,J.-H.Duan,L.Gao.An Improved Fruit Fly Optimization Algorithm for Continuous Function Optimization Problems.Knowledge-Based Systems 62(2014)69-83.
[22]C.Li,S.Xu,W.Li,L.Hu,A novel modified fly optimization algorithm for designing the self-tuning proportional integral derivative controller,Journal of Convergence Information Technology,7(16):69-77,2012.
[23]L.Wang,X.L.Zheng,S.Y.Wang,A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem,Knowledge-based Systems,48(2):17-23,2013.
[24]Q.K.Pan,L.Wang,K.Mao,J.H.Zhao,M.Zhang,An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process,IEEETransactions on Automation Science and Engineering,10(2):307-322,2013.
[25]E.Aghezzaf,A.Artiba,O.Moursli,C.Tahon,Hybrid flowshop problems,a decomposition based heuristic approach,In:Proceedings of the International Conference on Industrial Engineering and Production Management,IEPM’95,Marrakech,FUCAM-INRIA,43-56,1995.
[26]R.L.Graham,E.L.Lawler,J.K.Lenstra,A.H.G.Rinnooy Kan,Optimization and approximation in deterministic sequencing and scheduling:a survey,Annals of Discrete Mathematics,5(1):287-326,1979.
[27]A.Vignier,J.C.Billaut,C.Proust,Les problèmes d'ordonnancement de type flow-shop hybride:état de l'art.RAIRO-Recherche operationnelle.33,117-183,1999,in French.
[28]B.Naderi,R.Ruiz,M.Zandieh,Algorithms for a realistic variant of flowshop scheduling,Computers&Operations Research,37(2):236-246,2010.
[29]Q.-K.Pan.An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling,European Journal of Operational Research 250(2016)702-714.
[30]J.Fu,J.Faust,B.Chachuat,A.Mitsos,Local optimization of dynamic programs with guaranteed satisfaction of path constraints,Automatica,62(2015)184-192.
[2]Y.D.Kim,B.J.Joo,J.H.Shin,Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ration constraint,Journal of Heuristics,15(1):19-42,2009.
[3]F.Riane,A.Artiba,S.E.Elmaghraby,A hybrid three-stage flexible flowshop problem:Efficient heuristics to minimize makespan,European Journal of Operational Research,109(2):321-329,1998.
[4]H.Soewandi,S.E.Elmaghraby,Sequencing three-stage flexible flowshops with identical machines to minimize makespan,IIE Transactions 33(11):985-993,2001.
[5]R.Ruiz,C.Maroto,A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility,European Journal of Operational Research,169(3):781-800,2006.
[6]M.Nawaz,E.E.J.Enscore,I.Ham,A heuristic algorithm for the m-machine,n-job flow shop sequencing problem,OMEGA,11(1):91-95,1983.
[7]C.D.Paternina-Arboleda,J.R.Montoya-torres,M.J.Acero-Dominguez,M.C.Herrera-Hernandez,Scheduling jobs on a k-stage flexible flow-shop,Annals of Operations Research,164(1):29-40,2008.
[8]E.Nowicki,C.Smutnick,The flow shop with parallel machines:A tabu search approach.European Journal of Operational Research,106(2-3):226-253,1998.
[9]O.Engin,A.Doyen,A new approach to solve hybrid flow shop scheduling problems by artificial immune system,Future Generation Computer Systems,20(6):1083-1095,2004.
[10]K.Alaykyran,O.Engin,A.Doyen,Using ant colony optimization to solve hybrid flow shop scheduling problems,International Journal of Advanced Manufacturing Technology,35(5):541-550,2007.
[11]C.Kahraman,O.Engin O,I.Kaya,M.K.Yilmaz,An application of effective genetic algorithms for solving hybrid flow shop scheduling problems,International Journal of Computational Intelligence Systems,1(2):134-147,2008.
[12]Z.Jin,Z.Yang,T.Ito,Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem,International Journal of Production Economics,100(2):322-334,2006.
[13]Q.Niu,T.Zhou,S.Ma,A quantum-inspired immune algorithm for hybrid flow shop with makespan criterion,Journal of Universal Computer Science,15(4):765-785,2009.
[14]C.J.Liao,E.Tjandradjaj,T.P.Chung,An approach using particle swarm optimization and bottleneck heuristic to solve flowshop scheduling problem,Applied Soft Computing,12(6):1755-1764,2012.
[15]Q.K.Pan,M.F.Tasgetiren,Y.C.Liang,A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem,Computers&Operations Research,35(9):2807-2839,2008.
[16]S.Khaloui,F.Ghedjati,A.Hamzaoui,A meta-heuristic approach to solve a JIT scheduling problem in hybrid flowshop,Engineering Applications of Artificial Intelligence,23(5):765-771,2010.
[17]J.Carlier,E.Neron,An exact method for solving the multiprocessor flowshop.RAIRO-Operations Research,34(1):1-25,2000.
[18]W.T.Pan,A new fruit fly optimization algorithm:taking the financial distress model,Knowledge-based Systems,26(2):69-74,2012.
[19]H.Li,S.Guo,C.Li,J.Sun,A hybrid annual power load forecasting model based on generalized regression neural network with fruit fly optimization algorithm,Knowledge-based Systems,37(2):378-387,2013.
[20]S.M.Lin,Analysis of service satisfaction in web auction logistics service using a combination of fruit fly optimization algorithm and general regression neural network,Neural Computing&Applications,22(3):783-791,2011.
[21]Q.-K.Pan,H.-Y.Sang,J.-H.Duan,L.Gao.An Improved Fruit Fly Optimization Algorithm for Continuous Function Optimization Problems.Knowledge-Based Systems 62(2014)69-83.
[22]C.Li,S.Xu,W.Li,L.Hu,A novel modified fly optimization algorithm for designing the self-tuning proportional integral derivative controller,Journal of Convergence Information Technology,7(16):69-77,2012.
[23]L.Wang,X.L.Zheng,S.Y.Wang,A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem,Knowledge-based Systems,48(2):17-23,2013.
[24]Q.K.Pan,L.Wang,K.Mao,J.H.Zhao,M.Zhang,An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process,IEEETransactions on Automation Science and Engineering,10(2):307-322,2013.
[25]E.Aghezzaf,A.Artiba,O.Moursli,C.Tahon,Hybrid flowshop problems,a decomposition based heuristic approach,In:Proceedings of the International Conference on Industrial Engineering and Production Management,IEPM’95,Marrakech,FUCAM-INRIA,43-56,1995.
[26]R.L.Graham,E.L.Lawler,J.K.Lenstra,A.H.G.Rinnooy Kan,Optimization and approximation in deterministic sequencing and scheduling:a survey,Annals of Discrete Mathematics,5(1):287-326,1979.
[27]A.Vignier,J.C.Billaut,C.Proust,Les problèmes d'ordonnancement de type flow-shop hybride:état de l'art.RAIRO-Recherche operationnelle.33,117-183,1999,in French.
[28]B.Naderi,R.Ruiz,M.Zandieh,Algorithms for a realistic variant of flowshop scheduling,Computers&Operations Research,37(2):236-246,2010.
[29]Q.-K.Pan.An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling,European Journal of Operational Research 250(2016)702-714.
[30]J.Fu,J.Faust,B.Chachuat,A.Mitsos,Local optimization of dynamic programs with guaranteed satisfaction of path constraints,Automatica,62(2015)184-192.