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

• Type: Journal
• Year: 2006
• Where: APIN
• Authors: Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
• Keywords: APIN 2006, Multi-objective Problem, Vehicles, VRPTW