New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly higher than that of any previous heuristic approach and therefore likely to achieve better solutions to practical routing problems.

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

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

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

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

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

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

[7]  Alex Van Breedam,et al.  Comparing descent heuristics and metaheuristics for the vehicle routing problem , 2001, Comput. Oper. Res..

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

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

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

[11]  Sushil J. Louis,et al.  Multiple vehicle routing with time windows using genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[12]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[13]  Jean-Yves Potvin,et al.  A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints , 1994, Comput. Oper. Res..

[14]  Mohamed Haouari.  On the effectiveness of column generation for time constrained routing problems , 2001 .

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

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

[17]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

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

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