Evolving schedule graphs for the vehicle routing problem with time windows

H. Timucin Ozdemir, Chilukuri K. Mohan

Research output: Contribution to conferencePaper

8 Scopus citations

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 languageEnglish (US)
Pages888-895
Number of pages8
StatePublished - Dec 3 2000
EventProceedings of the 2000 Congress on Evolutionary Computation - California, CA, USA
Duration: Jul 16 2000Jul 19 2000

Other

OtherProceedings of the 2000 Congress on Evolutionary Computation
CityCalifornia, CA, USA
Period7/16/007/19/00

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science(all)
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Evolving schedule graphs for the vehicle routing problem with time windows'. Together they form a unique fingerprint.

  • Cite this

    Ozdemir, H. T., & Mohan, C. K. (2000). Evolving schedule graphs for the vehicle routing problem with time windows. 888-895. Paper presented at Proceedings of the 2000 Congress on Evolutionary Computation, California, CA, USA, .