Abstract
The Vehicle Routing Problem with Time Windows is a very important problem in the transportation industry since it occurs frequently in everyday practice, e.g., in scheduling bank deliveries. Many heuristic algorithms have been proposed for this NP-hard problem. This paper reports the successful application of GrEVeRT, an evolutionary algorithm based on a directed acyclic graph model. On well-known benchmark instances of VRPTW, we obtain better results than those reported by other researchers using genetic algorithms.
| Original language | English (US) |
|---|---|
| Pages | 888-895 |
| Number of pages | 8 |
| State | Published - 2000 |
| Event | Proceedings of the 2000 Congress on Evolutionary Computation - California, CA, USA Duration: Jul 16 2000 → Jul 19 2000 |
Other
| Other | Proceedings of the 2000 Congress on Evolutionary Computation |
|---|---|
| City | California, CA, USA |
| Period | 7/16/00 → 7/19/00 |
ASJC Scopus subject areas
- General Engineering
- General Computer Science
- Computational Theory and Mathematics