Genetic algorithms and VRP : the behaviour of a crossover operator

In the paper, we investigate the crossover operators for a vehicle routing problem where only feasible solutions are taken into account. New crossover operators are proposed that are based on the common sequence in the parent solutions. Random insertion heuristic is used as a reconstruction method in a crossover operator to preserve stochastic characteristics of the genetic algorithm. The genetic algorithm together with the new crossover operators can be applied to different VRP problems or other problems that can be expressed as a graph and depend on a sequence of elements. The proposed crossover operators are compared with other crossovers that deal with feasible solutions and insertion heuristics.

[1]  Morikazu Nakamura,et al.  A HYBRID SEARCH BASED ON GENETIC ALGORITHMS AND TABU SEARCH FOR VEHICLE ROUTING , 2002 .

[2]  Mohamed Barkaoui,et al.  A parallel hybrid genetic algorithm for the vehicle routing problem with time windows , 2004, Comput. Oper. Res..

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

[4]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[5]  John Holland,et al.  Adaptation in Natural and Artificial Sys-tems: An Introductory Analysis with Applications to Biology , 1975 .

[6]  Rudini Menezes Sampaio,et al.  A Hybrid Algorithm for the Vehicle Routing Problem with Time Window , .

[7]  Jane Yung-jen Hsu,et al.  A Family Competition Genetic Algorithm for the Pickup and Delivery Problems with Time Window , 2006 .

[8]  D. Reid.  Feasibility and Genetic Algorithms: The Behaviour of Crossover and Mutation , 2000 .

[9]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

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

[11]  Loo Hay Lee,et al.  Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..

[12]  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.

[13]  Kusum Deep,et al.  New Variations of Order Crossover for Travelling Salesman Problem , 2011, Int. J. Comb. Optim. Probl. Informatics.

[14]  Khairuddin Omar,et al.  Vehicle routing problem: models and solutions , 2008 .

[15]  Jean Berger,et al.  A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows , 1998, Canadian Conference on AI.

[16]  Beatrice M. Ombuki-Berman,et al.  Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows , 2006, Applied Intelligence.

[17]  Kun-Mao Chao,et al.  A fast algorithm for computing a longest common increasing subsequence , 2005, Inf. Process. Lett..

[18]  Deshi Ye,et al.  Efficient Algorithms for Finding a Longest Common Increasing Subsequence , 2005, ISAAC.

[19]  Alfonsas Misevičius,et al.  COMPARISON OF CROSSOVER OPERATORS FOR THE QUADRATIC ASSIGNMENT PROBLEM , 2005 .

[20]  Byung Ro Moon,et al.  A Hybrid Genetic Algorithm For The Vehicle Routing Problem With Time Windows , 2002, GECCO.

[21]  C. Schensted.  Longest Increasing and Decreasing Subsequences , 1961, Canadian Journal of Mathematics.

[22]  Abel García-Nájera,et al.  An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows , 2011, Comput. Oper. Res..

[23]  Olga Kurasova,et al.  Parallel Bidirectional Dijkstra's Shortest Path Algorithm , 2010, DB&IS.

[24]  Ahmad Abdollahzadeh Barforoush,et al.  A hybrid algorithm for the Vehicle Routing Problem , 2022 .

[25]  Tzung-Pei Hong,et al.  Evolution of Appropriate Crossover and Mutation Operators in a Genetic Process , 2001, Applied Intelligence.

[26]  Martin Lukasiewycz,et al.  A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems , 2008, PPSN.

[27]  Kay Chen Tan,et al.  A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows , 2003, Comput. Optim. Appl..

[28]  Yuichi Nagata,et al.  Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem , 2009, Networks.