A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

By Olli Bräysy. INFORMS journal on computing, 2003

320 citations recorded by the source corpus.

Subfields: Automotive Engineering, Building and Construction, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/07a4c1da9d80b0748da3a44a563a02bfae48b4a8

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

1. Michael Schneider
2. Stefan Røpke
3. Michel Gendreau
4. Teodor Gabriel Crainic
5. Thibaut Vidal
6. Dominik Goeke
7. Richard F. Hartl
8. Christian Prins

In Building and Construction

1. Michael Schneider
2. Dominik Goeke
3. Michel Gendreau
4. Teodor Gabriel Crainic
5. Thibaut Vidal
6. Stefan Røpke
7. David Pisinger
8. Christian Prins

In Industrial and Manufacturing Engineering

1. Michael Schneider
2. Michel Gendreau
3. Teodor Gabriel Crainic
4. Thibaut Vidal
5. Stefan Røpke
6. Dominik Goeke
7. Christian Prins
8. Richard F. Hartl

Citations in the corpus

• Ant Colony Optimization (2001, unknown): “Only recently has the approach presented in Bräysy (2003) achieved competitive results.”
• A variable neighborhood search heuristic for periodic routing problems (2009, methodology): “The VNS approach has already been successfully applied to other variants of the VRPs (see e.g. Braysy, 2003, Polacek et al., 2004, 2005).”
• Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, background): “53 NB09 : Nagata and Bräysy (2009) Hybrid GA Avg 10 +0.27 % 35.60 Opt 2.4 GHz 29.19 GG11 : Groër and Golden (2011) Para. R-to-R Best 5 +0.29 % 40×5.0 8×Xe 2.3 GHz 112.4 MB07-s : Mester and Bräysy (2007) slow EA+ELS Single +0.”
• A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows (2004, methodology): “Bräysy (2003) proposes a sophisticated four-stage algorithm that extends the previous approach with variable and large neighborhood search.”
• The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations (2014, methodology): “It has successfully been applied to a variety of combinatorial optimization problems, among them routing problems like VRPTW with single or multiple depots (Bräysy 2003, Polacek et al. 2004).”
• Vehicle Routing Problem with Time Windows, Part II: Metaheuristics (2005, methodology): “Only Liu and Shen (1999), Kilby et al. (1999), and Bräysy (2003) propose deterministic methods.”
• A general heuristic for vehicle routing problems (2007, background): “(BBB) [4], Homberger and Gehring (HG) [32], B räysy (B) [7], Bent and Van Hentenryck (BH) [2] and Ibaraki et al.”