A VEHICLE ROUTING PROBLEM WITH BACKHAULS AND TIME WINDOWS: A GUIDED LOCAL SEARCH SOLUTION

This paper presents a guided local search heuristic to solve a vehicle routing problem with backhauls and time windows. The VRPBTW with and without customer precedence are both considered. Customer precedence requires that all linehaul customers be visited before any backhaul customer. The basic approach is to construct an initial infeasible solution and then use a guided local search to improve the solution feasibility and quality. A new technique--section planning--is used to enhance the feasibility. Computational results show that the new heuristic can solve problems in which customers are distributed normally or in clusters. Some of the results are better than the best solutions that have appeared in the literature.

[1]  Jean-Yves Potvin,et al.  A genetic algorithm for vehicle routing with backhauling , 1996, Applied Intelligence.

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

[3]  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 .

[4]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[5]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[6]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[7]  Charlotte Diane Jacobs.  The vehicle routing problem with backhauls , 1987 .

[8]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[9]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[10]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[11]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[12]  Raymond K. Cheung,et al.  Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls , 2003 .

[13]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[14]  Marc Reimann,et al.  Comparing backhauling strategies in vehicle routing using Ant Colony Optimization , 2006, Central Eur. J. Oper. Res..

[15]  Charlotte Jacobs-Blecha.  The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms , 1998 .

[16]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[17]  Graham K. Rand,et al.  Vehicle Routing: Methods and Studies (Studies in Management Science and Systems, Volume 16) , 1988 .

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

[19]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

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

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

[22]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[23]  Paolo Toth,et al.  Advanced Methods in Transportation Analysis , 1997 .

[24]  Paolo Toth,et al.  A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls , 1996 .

[25]  Jean-Yves Potvin,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows , 1997, Transp. Sci..