VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. At the end, it will summarize the Genetic Algorithm solution proposed by K.Q. Zhu which was used in the programming part of the project.

[1]  Moses Charikar,et al.  The finite capacity dial-a-ride problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[2]  Loo Hay Lee,et al.  Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..

[3]  Sushil J. Louis,et al.  Multiple vehicle routing with time windows using genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[5]  Sam Kwong,et al.  Genetic Algorithms : Concepts and Designs , 1998 .

[6]  William Cook.  Solving Traveling Salesman Problems , 2002, ESA.

[7]  Li Xiang-yang.  Genetic algorithm for VRP , 2004 .

[8]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[9]  Michel Gendreau,et al.  DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

[10]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[11]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.