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

By Russell W. Bent, Pascal Van Hentenryck. Transportation Science, 2004

398 citations recorded by the source corpus.

Subfields: Automotive Engineering, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/c88a7ae45e8905a674e09a543b7228a6190c9d92

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automotive Engineering

In Industrial and Manufacturing Engineering

Citations in the corpus

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006, background): “The general idea is to remove requests that are somewhat similar, as we expect it to be reasonably easy to shufﬂe similar requests around and thereby create new, perhaps better solutions.”
Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem (2010, methodology): “SA is one of the commonly used meta-heuristics, and has been successfully applied to solve several types of VRP (Bent & Hentenryck, 2004; Breedam, 1995; Chiang & Russell, 1996; Osman, 1993; Tavakkoli-Moghaddam, Safaei, & Gholipour, 2006).”
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics (2005, methodology): “Benyahia and Potvin (1995) use a similar GA approach to optimize the parameter values of the sequential and parallel versions of Solomon’s (1987) insertion heuristic.”
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (2004, methodology): “Bertsimas and van Ryzin (1991, 1993) report some of the earliest work in mathematically studying some models of dynamic vehicle routing. They look at a model with Poisson arrival rates for customers that are uniformly distributed in the plane. The goal is to find a policy that minimizes the total sy”
A general heuristic for vehicle routing problems (2007, methodology): “The heuristics by Homberger and Gehring [32] and Bent and Van Hentenryck [2] obtain slightly better results compared to the best solutions obtained by ALNS-25K, but the papers do not state how many experiments that were performed to reach these results.”
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (2003, methodology): “Note that these times are comparable to those of our state-of-the-art VRPTW algorithm [ 1 ].”