Balance Between Genetic Search And Local Search In Hybrid Evolutionary Multi-criterion Optimization Algorithms

The aim of this paper is to clearly demonstrate the importance of finding a good balance between genetic search and local search in the implementation of hybrid evolutionary multi-criterion optimization (EMO) algorithms. We first modify the local search part of an existing multi-objective genetic local search (MOGLS) algorithm. In the modified MOGLS algorithm, the computation time spent by local search can be decreased by two tricks: to apply local search to only selected solutions (not all solutions) and to terminate local search before all neighbors of the current solution are examined. Next we show that the local search part of the modified MOGLS algorithm can be combined with other EMO algorithms. We implement a hybrid version of a strength Pareto evolutionary algorithm (SPEA). Using the modified MOGLS algorithm and the hybrid SPEA algorithm, we examine the balance between genetic search and local search through computer simulations on a two-objective flowshop scheduling problem. Computer simulations are performed using various specifications of parameter values that control the computation time spent by local search.

[1]  Jörg Homberger,et al.  Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows , 1999 .

[2]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[3]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[4]  Byung-Ro Moon,et al.  The natural crossover for the 2D Euclidean TSP , 2000 .

[5]  Hisao Ishibuchi,et al.  Multi-objective genetic local search algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[6]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[7]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[8]  Jesper Larsen,et al.  Parallelization of the Vehicle Routing Problem with Time Windows , 1999 .

[9]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[10]  Aravind Seshadri,et al.  A FAST ELITIST MULTIOBJECTIVE GENETIC ALGORITHM: NSGA-II , 2000 .

[11]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[12]  Clarisse Dhaenens,et al.  A Hybrid Evolutionary Approach for Multicriteria Optimization Problems: Application to the Flow Shop , 2001, EMO.

[13]  Loo Hay Lee,et al.  A messy genetic algorithm for the vehicle routing problem with time window constraints , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[14]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[15]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[16]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[17]  Jennifer Ryan,et al.  A Two-Dimensional Genetic Algorithm for the Ising Problem , 1991, Complex Syst..

[18]  Mathieu Willem Paul Savelsbergh,et al.  Computer aided routing , 1992 .

[19]  Sam R. Thangiah,et al.  An Adaptive Clustering Method Using a Geometric Shape for Vehicle Routing Problems with Time Windows , 1995, ICGA.

[20]  Kalyanmoy Deb,et al.  A Hybrid Multi-objective Evolutionary Approach to Engineering Shape Design , 2001, EMO.

[21]  Sam R. Thangiah,et al.  Vehicle Routing with Time Windows using Genetic Algorithms , 1997 .

[22]  James P. Cohoon,et al.  Genetic Placement , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[23]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[24]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[25]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[26]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[27]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[28]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[29]  Kendall E. Nygard,et al.  GIDEON: a genetic algorithm system for vehicle routing with time windows , 1991, [1991] Proceedings. The Seventh IEEE Conference on Artificial Intelligence Application.

[30]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[31]  Andrzej Jaszkiewicz,et al.  Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment , 2001, EMO.

[32]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[33]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[34]  Byung Ro Moon,et al.  On Multi-Dimensional Encoding/Crossover , 1995, ICGA.

[35]  Martin W. P. Savelsbergh,et al.  10. Vehicle routing: handling edge exchanges , 2003 .

[36]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..