An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

By Vera C. Hemmelmayr, Jean-François Cordeau, Teodor Gabriel Crainic. Computers & Operations Research, 2012

534 citations recorded by the source corpus.

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP.

Subfields: Building and Construction, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/2720300491e1062e27dfdd312efb067fc4b11b76

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

1. Michael Schneider
2. Dominik Goeke
3. R. Cuda
4. M. Speranza
5. Gianfranco Guastaroba
6. Michael Drexl

In Industrial and Manufacturing Engineering

1. Michael Schneider
2. Dominik Goeke
3. R. Cuda
4. M. Speranza
5. Gianfranco Guastaroba
6. Michael Drexl

Citations in the corpus

• Routing a mixed fleet of electric and conventional vehicles (2015, methodology): “Contrary to this, we always insert all removed customers in each ALNS step and handle the resulting infeasible solutions by means of a penalty mechanism (cp. Hemmelmayr et al. 2012, Dayarian et al. 2013).”
• A survey of variants and extensions of the location-routing problem (2015, methodology): “The best approaches for the NPP-P, NPP-N and S instances are CHC-A, which is based on the ALNS by Hemmelmayr et al. (2012), and SPR.”
• The vehicle routing problem: State of the art classification and review (2016, unknown): “…to other activities such as machine or production scheduling (see H.-K. Chen, Hsueh, & Chang, 2009; Ullrich, 2013), multi-echelon routing (see Baldacci, Mingozzi, Roberti, & Calvo, 2013; Hemmelmayr, Cordeau, & Crainic, 2012), and routing with cross-docking (see C.-J. Liao, Lin, & Shih, 2010).”
• A survey on two-echelon routing problems (2015, methodology): “[26], while the best exact algorithm is proposed in Baldacci et al.”