Tim Ozdemir, PhD, PMP

Tim Ozdemir, PhD, PMP

Columbia University Business School, MIT Sloan School of Management, Syracuse University, Hacettepe University

Evolving Schedule Graphs for the Vehicle Routing Problem with Time Windows

Published in Congress on Evolutionary Computation, CEC’2000, July 16-19, 2000, San Diego, USA, Vol. 2, pp. 888-895, 2000

Recommended citation: H. Timucin Ozdemir, Chilukuri Mohan. (2000). "Evolving Schedule Graphs for the Vehicle Routing Problem with Time Windows", in Congress on Evolutionary Computation, CEC’2000, July 16-19, 2000, San Diego, USA, Vol. 2, pp. 888-895. https://ieeexplore.ieee.org/document/870734

Abstract

The vehicle routing problem with time windows (VRPTW) 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
See -https://ieeexplore.ieee.org/document/870734

Download paper here

Recommended citation: H. Timucin Ozdemir, Chilukuri Mohan. (2000). “Evolving Schedule Graphs for the Vehicle Routing Problem with Time Windows”, in Congress on Evolutionary Computation, CEC’2000, July 16-19, 2000, San Diego, USA, Vol. 2, pp. 888-895.