Experimenting crossover operators to solve the vehicle routing problem with time windows by Genetic Algorithms
by Massimiliano Caramia, Riccardo Onori
International Journal of Operational Research (IJOR), Vol. 3, No. 5, 2008

Abstract: In the Vehicle Routing Problem with Time Windows (VRPTW), a set of vehicles with limited capacity are to be routed from a central depot to a set of geographically distributed customers with known demands and predefined time windows. To solve the problem, an optimum assignment of vehicles to each customer is needed to achieve the minimal total distance travelled without violating the vehicle capacity and time window constraints. VRPTW has been the subject of intensive research, mainly focused on the design of effective metaheuristics to cope with the high complexity of the problem. Among these, Genetic Algorithms (GAs) have received a special attention, especially for their capabilities in coding problem solutions and achieving good performance on real-world applications. The goal of this paper is to revise the state of the art and the performance of GAs applied to VRPTW; in particular, we experimented with different crossover techniques and provide a new crossover operator, called DAX, to find high quality solutions. Computational results on the performance of the operators are given on a real-world application.

Online publication date: Tue, 01-Jul-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com