A Hybrid ILS-VND Based Hyper-heuristic for Permutation Flowshop Scheduling Problem

In this paper an iterated local search (ILS) is embedded with a variable neighborhood Descent (VND) hyper-heuristic. The proposed hyper-heuristic combines low-level heuristics. Several variants from the literature within the proposed ILS were implemented and tested. This article conducts an empirical study involving hard combinatorial optimization problems, permutation flowshop scheduling problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. The proposed ILS based hyper-heuristic proved its general and applicable across the studied problems.

[1]  Günther R. Raidl,et al.  Bringing order into the neighborhoods: relaxation guided variable neighborhood search , 2008, J. Heuristics.

[2]  G. Dueck.  New optimization heuristics , 1993 .

[3]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[4]  Martin Josef Geiger,et al.  On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification , 2010, Eur. J. Oper. Res..

[5]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[6]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[7]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[8]  Edmund K. Burke,et al.  A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling , 2010, Int. J. Appl. Metaheuristic Comput..

[9]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[10]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[11]  Quan-Ke Pan,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[12]  Michel Gendreau,et al.  Adaptive iterated local search for cross-domain optimisation , 2011, GECCO '11.

[13]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[14]  John R. Woodward,et al.  Hyper-Heuristics , 2015, GECCO.

[15]  Matthijs den Besten,et al.  Design of Iterated Local Search Algorithms , 2001, EvoWorkshops.

[16]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[17]  Sanja Petrovic,et al.  Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms , 2010, IEEE Congress on Evolutionary Computation.

[18]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[19]  Jerzy Kamburowski,et al.  An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..

[20]  Matthias Fuchs,et al.  High Performance ATP Systems by Combining Several AI Methods , 1997, IJCAI.