7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

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

      research-article

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          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.

          Related collections

          Most cited references20

          • Record: found
          • Abstract: not found
          • Article: not found

          A Method for Solving Traveling-Salesman Problems

          G. Croes (1958)
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A comparative study of heuristics for a two-level routing-location problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              An Exchange Heuristic for Routeing Problems with Time Windows

                Bookmark

                Author and article information

                Contributors
                Journal
                Comput Oper Res
                Comput Oper Res
                Computers & Operations Research
                Pergamon Press
                0305-0548
                1873-765X
                1 December 2012
                December 2012
                : 39
                : 12
                : 3215-3228
                Affiliations
                [a ]Institute for Transport and Logistics Management, WU, Vienna University of Economics and Business, Nordbergstraße 15, 1090 Vienna, Austria
                [b ]Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT), C.P. 6128, Succ. Centre-ville, Montréal, Canada H3C 3J7
                [c ]ESG UQAM, 315 Ste-Catherine Est, Montréal, Canada H2X 3X2
                [d ]Canada Research Chair in Logistics and Transportation, HEC Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
                Author notes
                [* ]Corresponding author at: Institute for Transport and Logistics Management,WU, Vienna University of Economics and Business, Nordbergstraße 15,1090 Vienna, Austria. Vera.Hemmelmayr@ 123456wu.ac.at
                Article
                CAOR3070
                10.1016/j.cor.2012.04.007
                3587400
                23483764
                38728b97-398e-4eda-b90a-c319ec3874dd
                © 2012 Elsevier Ltd.

                This document may be redistributed and reused, subject to certain conditions.

                History
                Categories
                Article

                two-echelon vehicle routing problem,location routing problem,adaptive large neighborhood search heuristic,city logistics

                Comments

                Comment on this article