A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

Abstract This paper presents a solution methodology for the heterogeneous fleet vehicle routing problem with time windows. The objective is to minimize the total distribution costs, or similarly to determine the optimal fleet size and mix that minimizes both the total distance travelled by vehicles and the fixed vehicle costs, such that all problem’s constraints are satisfied. The problem is solved using a two-phase solution framework based upon a hybridized Tabu Search, within a new Reactive Variable Neighborhood Search metaheuristic algorithm. Computational experiments on benchmark data sets yield high quality solutions, illustrating the effectiveness of the approach and its applicability to realistic routing problems.

[1]  S. Salhi,et al.  Local Search Strategies for the Vehicle Fleet Mix Problem , 1996 .

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

[3]  Dong-wan Tcha,et al.  A column generation approach to the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

[4]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[5]  Christos D. Tarantilis,et al.  A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem , 2004, Eur. J. Oper. Res..

[6]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[7]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[8]  Daniele Vigo,et al.  Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows , 2007, Transp. Sci..

[9]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[10]  Bruce L. Golden,et al.  A comparison of techniques for solving the fleet size and mix vehicle routing problem , 1984 .

[11]  F.-H. Liu,et al.  The fleet size and mix vehicle routing problem with time windows , 1999, J. Oper. Res. Soc..

[12]  Gerrit K. Janssens,et al.  New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows , 2002, J. Oper. Res. Soc..

[13]  Martin Desrochers,et al.  A new heuristic for the fleet size and mix vehicle routing problem , 1991, Comput. Oper. Res..

[14]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[15]  CD Tarantilis,et al.  A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem , 2003, J. Oper. Res. Soc..

[16]  Frédéric Semet,et al.  A two-phase algorithm for the partial accessibility constrained vehicle routing problem , 1995, Ann. Oper. Res..

[17]  Said Salhi,et al.  Adaptation of some Vehicle Fleet Mix heuristics , 1992 .

[18]  Michel Gendreau,et al.  A tabu search heuristic for the heterogeneous fleet vehicle routing problem , 1999, Comput. Oper. Res..

[19]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[20]  Yves Rochat,et al.  A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland , 1994 .

[21]  Bruce L. Golden,et al.  A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

[22]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[23]  Christos D. Tarantilis,et al.  Solving the vehicle routing problem with adaptive memory programming methodology , 2005, Comput. Oper. Res..

[24]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.

[25]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[26]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[27]  George Ioannou,et al.  A greedy look-ahead heuristic for the vehicle routing problem with time windows , 2001, J. Oper. Res. Soc..

[28]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

[29]  Bruce L. Golden,et al.  A new heuristic for determining fleet size and composition , 1986 .

[30]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[31]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[32]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

[33]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[34]  Jacques Renaud,et al.  A sweep-based algorithm for the fleet size and mix vehicle routing problem , 2002, Eur. J. Oper. Res..

[35]  Christos D. Tarantilis,et al.  BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management , 2002, Ann. Oper. Res..

[36]  Roberto Cordone,et al.  A Heuristic for the Vehicle Routing Problem with Time Windows , 2001, J. Heuristics.

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

[38]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[39]  Christos D. Tarantilis,et al.  A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector , 2007, Eur. J. Oper. Res..

[40]  Bruce L. Golden,et al.  The fleet size and mix vehicle routing problem , 1984, Comput. Oper. Res..

[41]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[42]  Said Salhi,et al.  Incorporating vehicle routing into the vehicle fleet composition problem , 1993 .