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 out performs existing solution methods for the 2E-VRP and achieves excellent results on the LRP.
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:3856 |
| Date | 27 April 2012 |
| Creators | Hemmelmayr, Vera, Cordeau, Jean Francois, Crainic, Teodor Gabriel |
| Publisher | Elsevier |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, PeerReviewed |
| Format | application/pdf |
| Rights | Creative Commons: Attribution-Noncommercial-No Derivative Works 3.0 Austria |
| Relation | http://dx.doi.org/10.1016/j.cor.2012.04.007, http://www.journals.elsevier.com/computers-and-operations-research, https://www.elsevier.com/journals/computers-and-operations-research/0305-0548/open-access-options, http://epub.wu.ac.at/3856/ |
Page generated in 0.0024 seconds