A genetic algorithm for the vehicle routing problem with time windows
- UNCW Author/Contributor (non-UNCW co-authors, if there are any, appear on document)
- Lin Cheng (Creator)
- Institution
- The University of North Carolina Wilmington (UNCW )
- Web Site: http://library.uncw.edu/
- Advisor
- Yaw Chang
Abstract: The objective of the vehicle routing problem (VRP) is to deliver a set of customers
with known demands on minimum-cost vehicle routes originating and terminating at
the same depot. A vehicle routing problem with time windows (VRPTW) requires
the delivery be made within a speci¯c time frame given by the customers. Prins
(2004) recently proposed a simple and e®ective genetic algorithm (GA) for VRP. In
terms of average solution cost, it outperforms most published tabu search results.
We implement this hybrid GA to handle VRPTW. Both the implementation and
computational results will be discussed.
A genetic algorithm for the vehicle routing problem with time windows
PDF (Portable Document Format)
173 KB
Created on 1/1/2009
Views: 11621
Additional Information
- Publication
- Thesis
- A Thesis Submitted to the University of North Carolina Wilmington in Partial Ful¯llment Of the Requirements for the Degree of Master of Science
- Language: English
- Date: 2009
- Keywords
- Genetic algorithms, Heuristic programming, Transportation problems (Programming)
- Subjects
- Transportation problems (Programming)
- Genetic algorithms
- Heuristic programming