Title :
Vehicle routing problem using genetic algorithms based on adjacency relations
Author :
Uchimura, Keiichi ; Sakaguchi, Hideki
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Kumamoto Univ., Japan
Abstract :
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
Keywords :
driver information systems; genetic algorithms; adjacency relations; branch-and-bound method; crossover operators; digital road maps; genetic algorithms; partially matched crossover; truckload motor carriers; vehicle routing problem; Cities and towns; Computer science; Genetic algorithms; Genetic mutations; Law; Legal factors; Roads; Routing; Transportation; Vehicles;
Conference_Titel :
Vehicle Navigation and Information Systems Conference, 1995. Proceedings. In conjunction with the Pacific Rim TransTech Conference. 6th International VNIS. 'A Ride into the Future'
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2587-7
DOI :
10.1109/VNIS.1995.518841
