An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics

Vera Hemmelmayr, Jean Francois Cordeau, Teodor Gabriel Crainic

Publication: Scientific journalJournal articlepeer-review

34 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)3215 - 3228
JournalComputers and Operations Research
Issue number12
Publication statusPublished - 2012

Cite this