In the vehicle routing problem, the traditional crossover operators for genetic algorithms (GAs) could fail to produce legal tours. We propose a new crossover operator considering adjacency relations, and compare the new GA with the GA using the partially matched crossover or a branch-and-bound method. Some experiments are performed on digital road maps. The proposed GA finds optimum solutions effectively.
Vehicle routing problem using genetic algorithms based on adjacency relations
1995-01-01
297813 byte
Conference paper
Electronic Resource
English
Vehicle routing problem using genetic algorithms based on adjacency relations
Automotive engineering | 1995
|Vehicle Routing Problem Using Genetic Algorithms Based on Adjacency Relations
British Library Conference Proceedings | 1995
|Genetic Algorithms for Vehicle Routing Problem in Deliver System
British Library Conference Proceedings | 1994
|