A genetic algorithm based heuristic for the vehicle routing problem with multiple trips

A genetic algorithm based heuristic for the vehicle routing problem with multiple trips

0.00 Avg rating0 Votes
Article ID: iaor20084446
Country: United Kingdom
Volume: 6
Issue: 4
Start Page Number: 591
End Page Number: 613
Publication Date: Dec 2007
Journal: Journal of Mathematical Modelling and Algorithms
Authors: ,
Keywords: heuristics: genetic algorithms
Abstract:

A variant of the classical vehicle routing problem, where vehicles can be assigned to more than one route within a working time period, is investigated. A hybrid Genetic Algorithm, which uses a new non-binary chromosome representation and which is enhanced by a domain specific data structure, appropriate genetic operators and a scheme for chromosome evaluation, is proposed. Test problems from the literature are used to evaluate the performance of the proposed heuristic. Encouraging results are obtained.

Reviews

Required fields are marked *. Your email address will not be published.