A unified heuristic for a large class of Vehicle Routing Problems with Backhauls

By Stefan Røpke, David Pisinger. European Journal of Operational Research, 2006

516 citations recorded by the source corpus.

Subfields: Building and Construction, Industrial and Manufacturing Engineering

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

How researchers see this paper

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

In Building and Construction

In Industrial and Manufacturing Engineering

Citations in the corpus

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “The best metaheuristics include the ALNS of Ropke and Pisinger (2006); the tabu search of Brandão (2006), which, as Zachariadis and Kiranoudis (2011), uses long-term memories in order to direct the search toward inadequately exploited characteristics; and finally the ACO of Gajpal and Abad (2009),…”
Rich vehicle routing problems: From a taxonomy to a definition (2015, background): “A first step in this direction has been made by Røpke and Pisinger (2006), Subramanian et al. (2011), Derigs and Vogel (2014), and Vidal et al. (2013, 2014).”
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006, methodology): “In the papers by Pisinger and Ropke [16], [20] it is shown how the heuristic presented in this paper can be extended to solve a variety of vehicle routing problems, for example the VRPTW, the Multi Depot Vehicle Routing Problem and the Vehicle Routing Problem with Backhauls .”
Static pickup and delivery problems: a classification scheme and survey (2007, methodology): “ Ropke and Pisinger (2006b) have introduced a problem called the Rich Pickup and Delivery Problem with Time Windows and have developed a large neighborhood search (LNS) heuristic for it. The authors have shown how their heuristic can be used to solve a collection of 1-M-1-PDPs including the 1-M-1-P”
Fifty Years of Vehicle Routing (2009, background): “…– very large scale neighbourhood search (Ergun, 2001; Ergun, Orlin, Steele-Feldman, 2006) – destroy and repair (Shaw, 1997) – adaptive large scale neighbourhood search (Ropke and Pisinger, 2006) – limitation strategies in local search (Nagata, Bräysy, 2008) • Tabu management – attribute sets…”
A general heuristic for vehicle routing problems (2007, methodology): “In our past work [49, 50] we have removed up to 100 requests in e ach iteration.”
Routing a mixed fleet of electric and conventional vehicles (2015, methodology): “Worst removal was introduced by Ropke and Pisinger (2006b) and aims at removing vertices that are unfavorable at their current position in a route.”
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (2010, methodology): “Ropke and Pisinger [8] 2004 Large neighborhood search Nagy and Salhi [7] 2005 Heuristics with different levels of”
A unified solution framework for multi-attribute vehicle routing problems (2014, background): “As for the most general vehicle routing metaheuristics proposed in the literature (Cordeau et al. 1997, 2001, Ropke and Pisinger 2006a,b, Subramanian et al. 2013), they usually address a single difficult compound problem formulation including several variants as special cases, but still require…”