IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i4d10.1007_s10878-016-0028-6.html
   My bibliography  Save this article

A lower bound for the adaptive two-echelon capacitated vehicle routing problem

Author

Listed:
  • Liang Song

    (Harbin Institute of Technology Shenzhen Graduate School
    Shenzhen Key Laboratory of Internet Information Collaboration)

  • Hao Gu

    (Harbin Institute of Technology Shenzhen Graduate School
    Shenzhen Key Laboratory of Internet Information Collaboration)

  • Hejiao Huang

    (Harbin Institute of Technology Shenzhen Graduate School
    Shenzhen Key Laboratory of Internet Information Collaboration)

Abstract

Adaptive two-echelon capacitated vehicle routing problem (A2E-CVRP) proposed in this paper is a variant of the classical 2E-CVRP. Comparing to 2E-CVRP, A2E-CVRP has multiple depots and allows the vehicles to serve customers directly from the depots. Hence, it has more efficient solution and adapt to real-world environment. This paper gives a mathematical formulation for A2E-CVRP and derives a lower bound for it. The lower bound is used for deriving an upper bound subsequently, which is also an approximate solution of A2E-CVRP. Computational results on benchmark instances show that the A2E-CVRP outperforms the classical 2E-CVRP in the costs of routes.

Suggested Citation

  • Liang Song & Hao Gu & Hejiao Huang, 2017. "A lower bound for the adaptive two-echelon capacitated vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1145-1167, May.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:4:d:10.1007_s10878-016-0028-6
    DOI: 10.1007/s10878-016-0028-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-016-0028-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-016-0028-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mads Jepsen & Simon Spoorendonk & Stefan Ropke, 2013. "A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 47(1), pages 23-37, February.
    2. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti & Roberto Wolfler Calvo, 2013. "An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem," Operations Research, INFORMS, vol. 61(2), pages 298-314, April.
    3. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    4. S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam, 2014. "A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 414-446, August.
    5. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
    6. Tao Zhang & W. Art Chaovalitwongse & Yuejie Zhang, 2014. "Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 288-309, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liang Song & Hejiao Huang & Hongwei Du, 2016. "Approximation schemes for Euclidean vehicle routing problems with time windows," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1217-1231, November.
    2. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    3. Li, Jiliu & Xu, Min & Sun, Peng, 2022. "Two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 261-291.
    4. Liu, Tian & Luo, Zhixing & Qin, Hu & Lim, Andrew, 2018. "A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints," European Journal of Operational Research, Elsevier, vol. 266(2), pages 487-497.
    5. Zhen, Lu & Baldacci, Roberto & Tan, Zheyi & Wang, Shuaian & Lyu, Junyan, 2022. "Scheduling heterogeneous delivery tasks on a mixed logistics platform," European Journal of Operational Research, Elsevier, vol. 298(2), pages 680-698.
    6. Roberto Baldacci & Sandra Ulrich Ngueveu & Roberto Wolfler Calvo, 2017. "The Vehicle Routing Problem with Transhipment Facilities," Transportation Science, INFORMS, vol. 51(2), pages 592-606, May.
    7. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    8. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.
    9. Li, Hongqi & Liu, Yinying & Jian, Xiaorong & Lu, Yingrong, 2018. "The two-echelon distribution system considering the real-time transshipment capacity varying," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 239-260.
    10. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
    11. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    12. Wang, Minxi & Wang, Yajie & Liu, Wei & Ma, Yu & Xiang, Longtao & Yang, Yunqi & Li, Xin, 2021. "How to achieve a win–win scenario between cost and customer satisfaction for cold chain logistics?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    13. Huang, Yixiao & Savelsbergh, Martin & Zhao, Lei, 2018. "Designing logistics systems for home delivery in densely populated urban areas," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 95-125.
    14. Teobaldo Bulhões & Ruslan Sadykov & Anand Subramanian & Eduardo Uchoa, 2020. "On the exact solution of a large class of parallel machine scheduling problems," Journal of Scheduling, Springer, vol. 23(4), pages 411-429, August.
    15. Alexandra Anderluh & Vera C. Hemmelmayr & Pamela C. Nolz, 2017. "Synchronizing vans and cargo bikes in a city distribution network," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 345-376, June.
    16. Soysal, Mehmet & Bloemhof-Ruwaard, Jacqueline M. & Bektaş, Tolga, 2015. "The time-dependent two-echelon capacitated vehicle routing problem with environmental considerations," International Journal of Production Economics, Elsevier, vol. 164(C), pages 366-378.
    17. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    18. Zhu, Stuart X. & Ursavas, Evrim, 2018. "Design and analysis of a satellite network with direct delivery in the pharmaceutical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 190-207.
    19. Li, Hongqi & Zhang, Lu & Lv, Tan & Chang, Xinyu, 2016. "The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 169-188.
    20. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:33:y:2017:i:4:d:10.1007_s10878-016-0028-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.