Genetic Algorithm for the Time-Dependent Vehicle Routing Problem

A mathematical model is formulated for the time-dependent vehicle routing problem (TDVRP) and a genetic algorithm (GA) is proposed for solving it. Formulation of the problem considers multiple vehicles with different capacities, pick-up or delivery demands with soft time windows, real-time service requests, and real-time variations in travel times between demand nodes. The objective is to minimize the total cost, which consists of routing cost, fixed cost for using the vehicles, and customer inconvenience costs. A mixed-integer linear programming formulation of the TDVRP is presented. Like other combinatorial problems, to solve the TDVRP exactly, a significant amount of processing time is required. A GA is proposed to solve the problem. The proposed GA was tested on the test problems, and GA results were compared with the exact solutions for small test problems. GA results were also compared with the lower bounds obtained for the solution of the larger problems. In the case of small problems, only 2 of 33 cases have gaps between the GA solutions and the exact solutions, and the maximum gap is less than 5 percent. For larger problems, the maximum gaps between GA solutions and lower bound solutions are less than 7 percent.

[1]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[2]  Pavel Petrovic,et al.  Introduction to genetic heuristics and vehicle routing problems with complex constraints , 1997 .

[3]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[4]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[5]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[6]  Haiping Xu.  Optimal policies for stochastic and dynamic vehicle routing problems , 1994 .

[7]  K. Uchimura,et al.  Vehicle routing problem using genetic algorithms based on adjacency relations , 1995, Pacific Rim TransTech Conference. 1995 Vehicle Navigation and Information Systems Conference Proceedings. 6th International VNIS. A Ride into the Future.

[8]  E. H. Bowman.  Production Scheduling by the Transportation Method of Linear Programming , 1956 .

[9]  Abilio Lucena,et al.  Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.

[10]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[11]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[12]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[13]  S. Chatterjee,et al.  Genetic algorithms and traveling salesman problems , 1996 .

[14]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..