Sciweavers

Share
APIN
2006

Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows

8 years 8 months ago
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 customers or more are very hard to solve optimally. We represent the VRPTW as a multi-objective problem and present a genetic algorithm solution using the Pareto ranking technique. We use a direct interpretation of the VRPTW as a multi-objective problem, in which the two objective dimensions are number of vehicles and total cost (distance). An advantage of this approach is that it is unnecessary to derive
Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where APIN
Authors Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
Comments (0)
books