Evolving schedule graphs for the vehicle routing problem with time windows

Author

Ozdemir, H. Timucin ; Mohan, Chilukuri K.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Syracuse Univ., NY, USA

Volume

2

fYear

2000

fDate

2000

Firstpage

888

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. This paper reports the successful application of GrEVeRT (Graph-based Evolutionary algorithm for the Vehicle Routing Problem with Time windows), an evolutionary algorithm based on a directed acyclic graph model. On well-known benchmark instances of the VRPTW, we obtain better results than those reported by other researchers using genetic algorithms

Keywords

directed graphs; evolutionary computation; scheduling; transportation; GrEVeRT; NP-hard problem; bank delivery scheduling; directed acyclic graph model; graph-based evolutionary algorithm; heuristic algorithms; schedule graph evolution; time windows; transportation; vehicle routing problem; Computer industry; Computer science; Evolutionary computation; Genetic algorithms; Job shop scheduling; NP-hard problem; Processor scheduling; Routing; Transportation; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2000. Proceedings of the 2000 Congress on

Conference_Location

La Jolla, CA

Print_ISBN

0-7803-6375-2

Type

conf

DOI

10.1109/CEC.2000.870734

Filename

870734