Scatter search for the fleet size and mix vehicle routing problem with time windows

This work proposes a scatter search (SS) approach to solve the fleet size and mix vehicle routing problem with time windows (FSMVRPTW). In the FSMVRPTW the customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. Computational results on 168 benchmark problems are reported. Computational testing revealed that our algorithm presented better results compared to other methods published in the literature.

[1]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[2]  César Rego,et al.  A Scatter Search Tutorial for Graph-Based Permutation Problems , 2005 .

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

[4]  Philip Kilby,et al.  Vehicle Routing Problem with Time Windows , 2004 .

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

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

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

[8]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

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

[10]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

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

[12]  Bahram Alidaee,et al.  Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (Operations Research/Computer Science Interfaces Series) , 2005 .

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

[14]  Ibrahim H. Osman,et al.  Tabu search variants for the mix fleet vehicle routing problem , 2002, J. Oper. Res. Soc..

[15]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

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

[17]  Ángel Corberán,et al.  Heuristic solutions to the problem of routing school buses with multiple objectives , 2002, J. Oper. Res. Soc..

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

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

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

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

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

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