A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

  • Authors:

  • Russell Bent;Pascal Van Hentenryck

  • Affiliations:

  • Brown University, Box 1910, Providence, Rhode Island 02912;Brown University, Box 1910, Providence, Rhode Island 02912

  • Venue:
  • Transportation Science
  • Year:
  • 2004

Quantified Score

Hi-index 0.02

Visualization

Abstract

The vehicle routing problem with time windows is a hard combinatorial optimization problem that has received considerable attention in the last decades. This paper proposes a two-stage hybrid algorithm for this transportation problem. The algorithm first minimizes the number of vehicles, using simulated annealing. It then minimizes travel cost by using a large neighborhood search that may relocate a large number of customers. Experimental results demonstrate the effectiveness of the algorithm, which has improved 10 (17%) of the 56 best published solutions to the Solomon benchmarks, while matching or improving the best solutions in 46 problems (82%). More important perhaps, the algorithm is shown to be very robust. With a fixed configuration of its parameters, it returns either the best published solutions (or improvements thereof) or solutions very close in quality on all Solomon benchmarks. Very preliminary results on the extended Solomon benchmarks are also given.