The vehicle routing problem with time windows. Part II: Genetic search

The vehicle routing problem with time windows. Part II: Genetic search

0.00 Avg rating0 Votes
Article ID: iaor19982736
Country: United States
Volume: 8
Issue: 2
Start Page Number: 165
End Page Number: 172
Publication Date: Mar 1996
Journal: INFORMS Journal On Computing
Authors: ,
Keywords: heuristics
Abstract:

This paper is the second part of a work on the application of new search techniques for the vehicle routing problem with time windows. It describes GENEROUS, the GENEtic ROUting System, which is based on the natural evolution paradigm. Under this paradigm, a population of solutions evolves from one generation to the next by ‘mating’ parent solutions to form new offspring solutions that exhibit characteristics inherited from their parents. For this vehicle routing application, a specialized methodology is devised for merging two vehicle routing solutions into a single solution that is likely to be feasible with respect to the time window constraints. Computational results on a standard set of test problems are reported, and comparisons are provided with other heuristics.

Reviews

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