Incorporating Highly Explorative Methods to Improve the Performance of Variable Neighborhood Search

Variable Neighborhood Search (VNS) is one of the most recently introduced metaheuristics. Although VNS is successfully applied on various problem domains, there is still some room for it to get improved. While VNS has an efficient exploitation strategy, it suffers from its inefficient solution space exploration. To overcome this limitation, VNS can be joined with explorative methods such as Evolutionary Algorithms (EAs) which are global population-based search methods. Due to its effective search space exploration, Differential Evolution (DE) is a popular EA which is a great candidate to be joined with VNS. In this article, two different DEs are proposed to be combined with VNS. The first DE uses explorative evolutionary operators and the second one is a Multi-Population Differential Evolution (MP-DE). Incorporating a number of sub-populations improves the population diversity and increases the chance of reaching to unexplored regions. Both proposed hybrid methods are evaluated on the classical Job Shop Scheduling Problems. The experimental results reveal that the combination of VNS with more explorative method is more reliable to find acceptable solutions. Furthermore, the proposed methods offer competitive solutions compared to the state-of-the-art hybrid EAs proposed to solve JSSPs.

[1]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[2]  C. Bierwirth A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[3]  Ziad Kobti,et al.  Incorporating a Genetic Algorithm to improve the performance of Variable Neighborhood Search , 2012, 2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC).

[4]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[5]  Massimiliano Vasile,et al.  An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization , 2011, IEEE Transactions on Evolutionary Computation.

[6]  Hitoshi Iba,et al.  Accelerating Differential Evolution Using an Adaptive Local Search , 2008, IEEE Transactions on Evolutionary Computation.

[7]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[8]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[9]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[10]  Cheng Wu,et al.  A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem , 2011 .

[11]  Arvind S. Mohais,et al.  DynDE: a differential evolution for dynamic optimization problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[12]  Xianpeng Wang,et al.  A population-based variable neighborhood search for the single machine total weighted tardiness problem , 2009, Comput. Oper. Res..

[13]  Christos D. Tarantilis,et al.  A hybrid evolutionary algorithm for the job shop scheduling problem , 2009, J. Oper. Res. Soc..

[14]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[15]  Gregorio Tirado,et al.  The double traveling salesman problem with multiple stacks: A variable neighborhood search approach , 2009, Comput. Oper. Res..

[16]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[17]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[18]  Ling Wang,et al.  A hybrid differential evolution method for permutation flow-shop scheduling , 2008 .

[19]  Nenad Mladenovic,et al.  Variable neighborhood search for the heaviest k-subgraph , 2009, Comput. Oper. Res..

[20]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[21]  Mehmet Fatih Tasgetiren,et al.  A Multi-Populated Differential Evolution Algorithm for Solving Constrained Optimization Problem , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[22]  Philippe Lacomme,et al.  A memetic algorithm for the job-shop with time-lags , 2008, Comput. Oper. Res..

[23]  Krzysztof Fleszar,et al.  An effective VNS for the capacitated p-median problem , 2008, Eur. J. Oper. Res..

[24]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[25]  Ziad Kobti,et al.  A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic , 2012, Memetic Comput..

[26]  Voratas Kachitvichyanukul,et al.  Two enhanced differential evolution algorithms for job shop scheduling problems , 2012 .

[27]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[28]  Yuping Wang,et al.  A new hybrid genetic algorithm for job shop scheduling problem , 2012, Comput. Oper. Res..

[29]  Carlos A. Coello Coello,et al.  A Cultural Algorithm for Solving the Job Shop Scheduling Problem , 2005 .

[30]  Dimitris K. Tasoulis,et al.  Parallel differential evolution , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[31]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[32]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[33]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[34]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[35]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[36]  Pierre Hansen,et al.  Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.

[37]  Wei-jie Yu,et al.  Multi-population differential evolution with adaptive parameter control for global optimization , 2011, GECCO '11.

[38]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[39]  Li-Chen Fu,et al.  NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems , 2011, Expert Syst. Appl..

[40]  Yaochu Jin,et al.  Knowledge incorporation in evolutionary computation , 2005 .

[41]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[42]  Renata Mansini,et al.  The traveling purchaser problem with budget constraint , 2009, Comput. Oper. Res..

[43]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[44]  Manisha Sharma,et al.  Reserve constrained multi-area economic dispatch employing differential evolution with time-varying mutation , 2011 .

[45]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .