`a`

Solve the vehicle routing problem with time windows via a genetic algorithm

Pages: 240 - 249, Issue Special, September 2007

 Abstract        Full Text (190.8K)              

Yaw Chang - Mathematics and Statistics, University of North Carolina at Wilmington, 601 S. College Rd, Wilmington, NC 28403, United States (email)
Lin Chen - Mathematics and Statistics, University of North Carolina at Wilmington, 601 S. College Rd, Wilmington, NC 28403, United States (email)

Abstract: The objective of vehicle routing problem (VRP) is to deliver a set of customers with known demands on minimum-cost routes originating and terminating at the same depot. A vehicle routing problem with time windows (VRPTW) requires the delivery made in a specific time window given by the customers. Prins (2004) proposed a simple and effective genetic algorithm (GA) for VRP. In terms of average solution, it outperforms most published tabu search results. We implement this hybrid GA to handle VRPTW. Both the implementation and computation results will be discussed.

Keywords:  vehicle routing problem, vehicle routing problem with time window, genetic algorithm.
Mathematics Subject Classification:  Primary: 58F15, 58F17; Secondary: 53C35.

Received: September 2006;      Revised: June 2007;      Published: September 2007.