A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows

This article describes a tabu search heuristic for the vehicle routing problem with backhauls and time windows. In this problem, the set of customers is partitioned into two subsets: linehaul customers where a given quantity of goods is delivered from a central depot, and backhaul customers where a given quantity of goods is collected and transported to the depot. Mixed routes with both linehaul and backhaul customers are constructed. A variant of this problem is examined where linehauls must precede bachhauls on each route. Furthermore, the time of beginning of service at each customer location must occur within a particular time interval. Computational results are reported on a standard set of test problems, and comparisons are made with other heuristic approaches and with optimal solutions.

[1]  Kenneth L. Stott,et al.  A MODEL-BASED DECISION SUPPORT SYSTEM FOR PLANNING AND SCHEDULING OCEAN-BORNE TRANSPORTATION , 1981 .

[2]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[3]  Sylvie Gélinas,et al.  A new branching strategy for time constrained routing problems with application to backhauling , 1992, Ann. Oper. Res..

[4]  B. Garcia,et al.  ACCELERATION DU CALCUL DES FONCTIONS OBJECTIF POUR LES PROBLEMES DE TOURNEES DE VEHICULES AVEC FENETRES DE TEMPS , 1995 .

[5]  Sam R. Thangiah,et al.  Vehicle Routing with Time Windows using Genetic Algorithms , 1997 .

[6]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[7]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

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

[9]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[10]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[11]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[12]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[13]  Bruce L. Golden,et al.  VEHICLE ROUTING WITH BACKHAULS: MODELS, ALGORITHMS, AND CASE STUDIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[14]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[15]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[16]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[17]  M. Goetschalckx,et al.  The vehicle routing problem with backhauls , 1989 .

[18]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[19]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..