Skip to main content
Article thumbnail
Location of Repository

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

By Vera Hemmelmayr, Jean Francois Cordeau and Teodor Gabriel Crainic


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\ud 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\ud problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm out performs existing solution methods for the 2E-VRP and achieves excellent results on the LRP

Topics: Two-Echelon / Vehicle Routing Problem / Location Routing Problem / Adaptive large neighborhood search / heuristic / City logistics
Publisher: Elsevier
Year: 2012
DOI identifier: 10.1016/j.cor.2012.04.007
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.