Nature-inspired Metaheuristic Optimization Technique-Migrating bird‟s optimization in Industrial Scheduling Problem
| International Journal of Industrial Engineering |
| © 2014 by SSRG - IJIE Journal |
| Volume 1 Issue 2 |
| Year of Publication : 2014 |
| Authors : Ramanathan.L and Ulaganathan.K |
10.14445/23499362/IJIE-V1I3P101
How to Cite?
Ramanathan.L and Ulaganathan.K, "Nature-inspired Metaheuristic Optimization Technique-Migrating bird‟s optimization in Industrial Scheduling Problem," SSRG International Journal of Industrial Engineering, vol. 1, no. 2, pp. 12-17, 2014. Crossref, https://doi.org/10.14445/23499362/IJIE-V1I3P101
Abstract:
Migrating birds optimization (MBO) is a new nature-inspired metaheuristic for combinatorial optimization problems. This paper proposes application of MBO in a flow shop sequencing problem, which has important practical applications in modern industry. FSSP is a typical NP-Hard problem (non deterministic polynomial time) which is desired to be minimum make span. As the basic MBO algorithm is designed for discrete problems. The performance of basic MBO algorithm is tested via some FSSP data sets exist in literature. A mixed neighborhood is constructed for the leader and the following birds to easily find promising neighboring solutions. Extensive comparative evaluations are conducted with recently published algorithms in the literature.
Keywords:
Scheduling, Flow shop, NP-Hard, Metaheuristic Methods, Make span.
References:
[1] Duman.E.Uysal.M and Alkaya.A.F,(2012),“Migrating bird optimization: new metaheuristic approach and its performance on quadratic assignment problems”. Information sciences, Vol.217,pp.65-77.
[2] Imma Ribas,Rainer Leisten, Jose.M Framinan,(2009),"Review and classification of hybrid flow shop scheduling problems from A production system and A solutions procedure perspective". Computers and operations research,Vol.37,pp.1439-1454.
[3] Ravindra K. Ahuja ,Ozlem Ergun,james B. Orlin,(2002),"A survey of very large scale neighborhood search techniques“, Discrete Applied Mathematics, Vol.123,pp.75-102.
[4] Nilgun Fescioglu-unver,(2010),"Self controlling Tabu search algorithm for the quadratic assignment problem." Computers And Industrial Engineering,Vol.60,pp. 310-319.
[5] Rui Zhang,Cheng Wu,(2009),"Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm", Informational Sciences,Vol.188,pp.236-252.
[6] Guan-chun Luh,chung-huei Chueh,(2007),"A multi-modal immune algorithm for the job shop scheduling problem", Information Sciences,Vol.179,pp.1516-1532.
[7] Thomas Alerstam,Dept Of Biology,(2012),“Optimal bird migration revisited”. Peer-00697238,version 1.
[8] Lin-yu Tseng,ya-tai Lin,(2007),"A genetic local algorithm for minimizing total flow time in the permutation flow shop scheduling problem". Int.J.Production Economics,Vol.127,pp.121-128.
[9] Herbert G.Campbell,Richard A.Dudek,(1970), "A heuristic algorithm for the N job,m machine sequencing problem". Management Science, Vol.160,pp.123-130.
[10] Orhan Engin,Alper Doyen,(2004),"A new approach to solve hybrid flow shop scheduling problem by artificial immune system ",Future Generation Computer Systems,Vol.20,pp.1083-1095.
[11] Mohsen Ziaee,(2010),"General flow shop scheduling problem with sequence dependent setup times: A heuristic approach", Information Sciences,Vol.251,pp.126-135.
[12] Ruben Ruiz,jose Antonio Vazquez ,(2009),"The hybrid flow shop scheduling problem", European Journal Of Operation Research,Vol.205,pp.1-18.
[13] David J. Willis,Jaime Peraire,(1999),"A computational investigation of bio inspired formation flight and ground effect ".American Institute Of Aeronautics And Astronautics,Vol.1,pp.1-35.
[14] J.Behnamian,M.Zandieh,(2011),"A discrete colonial competitive algorithm for hybrid flow shop scheduling to minimize earliness and quadratic tardiness penalties", Expert Systems With Applications,Vol.38,pp.14490-14498.
[15] Rubenz Ruiz, Concepcion Maroto,(2005),"A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility", European Journal Of Operational Research,Vol.169,pp.781-800.
[16] B.Naderi,Ruben Ruiz ,(2009),"Algorithms for A realistic variant of flow shop scheduling", Computers & Operations Research,Vol. 37,pp.236-246.
[17] Ching-jong Liao,Evi Tjandradjaja,(2011),"An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem", Applied Soft Computing,Vol.12,pp.1755-1764.
[18] B.Naderi,m.Zandieh,(2009),"An improved simulated annealing for hybrid flow shops with sequence dependent setup and transportation times to minimize total completion time and total tardiness", Expert Systems With Applications,Vol.36,pp.9625-9633.
[19] Zhihong Jin,zan Yang,(2006)," Metaheuristic algorithms for the multistage hybrid flow shop scheduling problem",Int.J.Production Economics,Vol.100,pp.322-334.
[20] Shih-chang Wang,ming-feng Yeh,(2010),"A modified particle swarm optimization for aggregate production planning", Expert Systems With Applications ,Vol.41,pp.3069-3077.
[21] Magdalene Marinaki,Yannis Mariachis,(2008),“Honey bees mating optimization algorithm for financial classification problems", Applied Soft Computing,Vol.10,pp.806-812.
[22] Alireza Askarzadeh,(2012)," Bird mating optimizer: an optimization algorithm inspired by bird mating strategies",Commun Nonlinear Sci Numer Simulat,Vol.19,pp.1213-1228.
[23] Samir Sayah,abdellatif Hamouda,(2011),"A hybrid differential evolution algorithm based on particle swarm optimization for nonconvex economic dispatch problems", Applied Soft Computing,Vol.13,pp.1608-1619.
[24] Christoper C.Yang,jerome Yen,(2000),"Intelligent internet searching agent based on hybrid simulated annealing", Decision Support Systems,Vol.28,pp.269-277.
[25] B.Naderi,ruben Ruiz,(2009),"Algorithms for A realistic variant of flow shop scheduling", Computers & Operations Research,Vol.37,pp.236-246.
[26] Huizhen Zhang, Cesar Beltran,(2010),"Effective Formulation Reductions For The Quadratic Assignment Problem", Computers & Operations Research,Vol. 37,pp.2007-2016.
[27] Ching-jong Liao,Evi Tjandradjaja,(2011),"An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem", Applied Soft Computing,Vol.12,pp.1755-1764.
[28] Rui Zhang,Cheng Wu,(2009), "Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm", Informational Sciences,Vol.188,pp.236-252.
[29] Wen-Hung Kuo , Chou-Jung Hsu,(2010), “Worst-case and numerical analysis of heuristic algorithms for flow shop scheduling problems with a time-dependent learning effect”, Information Sciences, Vol.184,pp.282–297.
[30] Salwani Abdullah,hamza Turabieh,(2011), “On the use of multi neighborhood structures within A tabu-based memetic approach to university timetabling problem", Informational Sciences,Vol.191,pp.146-168.