IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v12y2020i3p1077-d315977.html
   My bibliography  Save this article

A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

Author

Listed:
  • Keyju Lee

    (School of Air Transport, Transportation and Logistics, Korea Aerospace University, Goyang, Gyeonggi-do 10540, Korea)

  • Junjae Chae

    (School of Air Transport, Transportation and Logistics, Korea Aerospace University, Goyang, Gyeonggi-do 10540, Korea)

  • Bomi Song

    (School of Air Transport, Transportation and Logistics, Korea Aerospace University, Goyang, Gyeonggi-do 10540, Korea)

  • Donghyun Choi

    (School of Air Transport, Transportation and Logistics, Korea Aerospace University, Goyang, Gyeonggi-do 10540, Korea)

Abstract

In Southeast Asian cities, it is common for logistic companies to operate a heterogeneous fleet of delivery vehicles with motorcycles being the preferred vehicle to handle the final phase of delivery. In such scenarios, heterogeneous fleet vehicle routing problem (HFVRP) is generally applied to plan an optimal delivery. However, in many downtown cores of large and rapidly developing Southeast Asian cities, HFVRP is neither viable nor reliable because of road usage restrictions. The purpose of this article is to develop and test a different approach that accurately takes these restrictions into account and provides viable and more sustainable results. Restrictions in this paper refer to situations of urban areas in Vietnam where (i) certain vehicle types are prohibited in specified areas or where narrow alleyways limit the utilization of vehicles that exceed the road capacity and (ii) certain roads are exclusive to certain vehicle types. In networks, limited access and exclusive lanes are represented as links, or arcs, exclusive to one or another. Taking these limitations into consideration, we have developed a unique model, which we have termed Vehicle Routing Problem with Exclusive Links (VRP-EL). The model was validated and tested for its performance on scenarios with varying ratios of exclusive links. Scenarios up to 500 customers were tested on a meta-heuristic algorithm, simulated annealing. VRP-EL produces realistic outcomes. Limiting certain links to be selected according to vehicle types increases overall travel distance. However, this increase outweighs the cost of re-planning and rerouting had they not been constrained initially. The reduction in traveling distance leads to fossil fuel reduction for the overall system. The estimation of reduced carbon emissions through applying the proposed model is presented. Considering the severe traffic congestion and carbon emissions caused by motorcycles in Vietnam, the proposed model leads to a sustainable road environment.

Suggested Citation

  • Keyju Lee & Junjae Chae & Bomi Song & Donghyun Choi, 2020. "A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes," Sustainability, MDPI, vol. 12(3), pages 1-19, February.
    • Handle: RePEc:gam:jsusta:v:12:y:2020:i:3:p:1077-:d:315977
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/12/3/1077/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/12/3/1077/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Keyju Lee & Junjae Chae & Jinwoo Kim, 2019. "A Courier Service with Electric Bicycles in an Urban Area: The Case in Seoul," Sustainability, MDPI, vol. 11(5), pages 1-19, February.
    2. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    3. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    4. Achuthan, N. R. & Caccetta, L. & Hill, S. P., 1996. "A new subtour elimination constraint for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 573-586, June.
    5. Tarantilis, C.D. & Kiranoudis, C.T., 2007. "A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector," European Journal of Operational Research, Elsevier, vol. 179(3), pages 806-822, June.
    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. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2021. "A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm," Mathematics, MDPI, vol. 9(13), pages 1-44, July.

    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. Heungjo An & Young-Ji Byon & Chung-Suk Cho, 2018. "Economic and Environmental Evaluation of a Brick Delivery System Based on Multi-Trip Vehicle Loader Routing Problem for Small Construction Sites," Sustainability, MDPI, vol. 10(5), pages 1-14, May.
    2. Houda Derbel & Bassem Jarboui & Rim Bhiri, 2019. "A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem," Annals of Operations Research, Springer, vol. 272(1), pages 243-272, January.
    3. Sumanta Basu & Ghosh, Diptesh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers WP2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    4. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    5. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    6. Hong Chen & Wenzhe Hu, 2020. "Determining Whether Trade Can Affect Regional Environmental Sustainability from the Perspective of Environmental Pollution," Sustainability, MDPI, vol. 12(5), pages 1-15, February.
    7. Yu, Bin & Yang, Zhong-Zhen & Yao, Baozhen, 2009. "An improved ant colony optimization for vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 171-176, July.
    8. Oscar Dominguez & Angel A. Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, January.
    9. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    10. Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.
    11. Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando & Toledo, Franklina M.B., 2014. "A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company," European Journal of Operational Research, Elsevier, vol. 237(2), pages 729-737.
    12. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    13. Zhang, Zhenzhen & Wei, Lijun & Lim, Andrew, 2015. "An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 20-35.
    14. Narayanan, Santhanakrishnan & Antoniou, Constantinos, 2022. "Electric cargo cycles - A comprehensive review," Transport Policy, Elsevier, vol. 116(C), pages 278-303.
    15. Patterson, S.R. & Kozan, E. & Hyland, P., 2017. "Energy efficient scheduling of open-pit coal mine trucks," European Journal of Operational Research, Elsevier, vol. 262(2), pages 759-770.
    16. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    17. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    18. N. R. Achuthan & L. Caccetta & S. P. Hill, 2003. "An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 37(2), pages 153-169, May.
    19. Imen Ben Mohamed & Walid Klibi & Olivier Labarthe & Jean-Christophe Deschamps & Mohamed Zied Babai, 2017. "Modelling and solution approaches for the interconnected city logistics," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2664-2684, May.
    20. Yu, Yang & Wang, Sihan & Wang, Junwei & Huang, Min, 2019. "A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 511-527.

    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:gam:jsusta:v:12:y:2020:i:3:p:1077-:d:315977. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.