A variable neighborhood search heuristic for periodic routing problems

By Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl. European Journal of Operational Research, 2009

334 citations recorded by the source corpus.

How researchers see this paper

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

Electric Vehicle Routing and Charging/Discharging under Time-Variant Electricity Prices (2020, background): “To further diversify the search, S ′′ is also accepted with a probability of e [ fgen(S)−fgen(S ′′ ) Temp ] if it is worse than the current solution S (Schneider et al. 2014, Hemmelmayr et al. 2009, Stenger et al. 2013).”
Rich vehicle routing problems: From a taxonomy to a definition (2015, background): “A vast literature is dedicated to the PVRP, see e.g., Cordeau, Gendreau, and Laporte (1997), Francis and Smilowitz (2006), Hemmelmayr, Doerner, and Hartl (2009), Wen, Cordeau, Laporte, and Larsen (2010), Baldacci, Bartolini, Mingozzi, and Valletta (2011), Gulczynski, Golden, and Wasil (2011), Vidal…”
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations (2014, methodology): “…the VNS defined by the number of involved route #Rts and the maximum number of translocated vertices Γ max . or a variant that is restricted to two routes, called cross-exchange, are commonly used in the perturbation phase of VNS-algorithms (see, e.g, Polacek et al. 2004, Hemmelmayr et al. 2009).”