journal article·2023Open access

Genetic Crossover Operators for the Capacitated Vehicle Routing Problem

Zakir Hussain Ahmed, Naif Al-Otaibi, Abdullah Al-Tameem, Abdul Khader Jilani Saudagar

Computers, Materials & Continua· Volume 74· Issue 1

Abstract

We study the capacitated vehicle routing problem (CVRP) which is a well-known NP-hard combinatorial optimization problem (COP). The aim of the problem is to serve different customers by a convoy of vehicles starting from a depot so that sum of the routing costs under their capacity constraints is minimized. Since the problem is very complicated, solving the problem using exact methods is almost impossible. So, one has to go for the heuristic/metaheuristic methods and genetic algorithm (GA) is broadly applied metaheuristic method to obtain near optimal solution to such COPs. So, this paper studies GAs to find solution to the problem. Generally, to solve a COP, GAs start with a chromosome set named initial population, and then mainly three operators-selection, crossover and mutation, are applied. Among these three operators, crossover is very crucial in designing and implementing GAs, and hence, numerous crossover operators were developed and applied to different COPs. There are two major kinds of crossover operators-blind crossovers and distance-based crossovers. We intend to compare the performance of four blind crossover and four distance-based crossover operators to test the suitability of the operators to solve the CVRP. These operators were originally proposed for the standard travelling salesman problem (TSP). First, these eight crossovers are illustrated using same parent chromosomes for building offspring(s). Then eight GAs using these eight crossover operators without any mutation operator and another eight GAs using these eight crossover operators with a mutation operator are developed. These GAs are experimented on some benchmark asymmetric and symmetric instances of numerous sizes and various number of vehicles. Our study revealed that the distance-based crossovers are much superior to the blind crossovers. Further, we observed that the sequential constructive crossover with and without mutation operator is the best one for the CVRP. This estimation is validated by Student’s t-test at 95% confidence level. We further determined a comparative rank of the eight crossovers for the CVRP.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Vehicle Routing Optimization Methods · Optimization and Packing Problems · Metaheuristic Optimization Algorithms Research

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (37)

Show source-provided references
1. The truck dispatching problem10.1287/mnsc.6.1.80 ↗
2. The vehicle-routing problem10.1016/B978-0-12-385202-1.00008-6 ↗
3. Analysis of network structure of urban bike-sharing system: A case study based on real-time data of a public bicycle system10.3390/su11195425 ↗
4. Intelligent vehicle scheduling and routing for a chain of retail stores: A case study of Dhaka, Bangladesh10.3390/logistics5030063 ↗
5. UAVs path planning architecture for effective medical emergency response in future networks10.1016/j.phycom.2021.101337 ↗
6. Toth · Society for Industrial and Applied Mathematics · 2014 · 1
7. An algorithm for the travelling salesman problem10.1287/opre.11.6.972 ↗
8. Branch-and-price: Column generation for solving huge integer programs10.1287/opre.46.3.316 ↗
9. Gomory · 50 Years of Integer Programming 1958–2008 · 2010 · 7710.1007/978-3-540-68279-0_4 ↗
10. A Data-guided lexisearch algorithm for the asymmetric traveling salesman problem10.1155/2011/750968 ↗
11. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length10.1016/j.amc.2005.09.040 ↗
12. A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars10.1016/j.ejor.2009.05.008 ↗
13. Ant colony optimization for the two-dimensional loading vehicle routing problem10.1016/j.cor.2007.10.021 ↗
14. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery10.1016/j.cor.2008.04.003 ↗
15. A vehicle routing problem solved by using a hybrid genetic algorithm10.1016/j.cie.2007.06.031 ↗
16. A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem10.1016/j.ejor.2012.01.036 ↗
17. Goldberg · Genetic Algorithms in Search, Optimization, and Machine Learning · 1989
18. A simple and effective evolutionary algorithm for the vehicle routing problem10.1016/S0305-0548(03)00158-8 ↗
19. Comparing the performance of genetic operators for the vehicle routing problem10.3182/20100908-3-PT-3007.00068 ↗
20. An algorithm for the vehicle despatching problem10.1057/jors.1969.75 ↗
21. Optimised crossover genetic algorithm for capacitated vehicle routing problem10.1016/j.apm.2011.08.010 ↗
22. Comparison of eight evolutionary crossover operators for the vehicle routing problem
23. A study of crossover operators for genetic algorithms to solve vrp and its variants and new sinusoidal motion crossover operator
24. A novel algorithm for capacitated vehicle routing problem for smart cities10.3390/sym13101923 ↗
25. Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator
26. Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems10.1016/j.neucom.2016.11.098 ↗
27. Some simple applications of the travelling salesman problem10.1057/jors.1975.151 ↗
28. A lexisearch algorithm for the distance-constrained vehicle routing problem
29. Alleles, loci and the travelling salesman problem
30. Job-shop scheduling with genetic algorithms
31. Genetic algorithms for the traveling salesman problem
32. A study of permutation crossover operators on the travelling salesman problem
33. Grefenstette · Genetic Algorithms and Simulated Annealing · 1987 · 42
34. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem
35. A Branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs10.1287/opre.42.5.846 ↗
36. An algorithm for the vehicle routing dispatching problem10.1057/jors.1969.75 ↗
37. Adaptive sequential constructive crossover operator in a genetic algorithm for solving the traveling salesman problem