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

Path Optimization Model for Intra-City Express Delivery in Combination with Subway System and Ground Transportation

Author

Listed:
  • Laijun Zhao

    (Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030, China
    China Institute for Urban Governance, Shanghai Jiao Tong University, Shanghai 200030, China
    Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Xiaoli Wang

    (Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030, China
    Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China
    School of Management, Shanghai University of Engineering Science, Shanghai 200030, China)

  • Johan Stoeter

    (Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Yan Sun

    (Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Huiyong Li

    (Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Qingmi Hu

    (Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Meichen Li

    (Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030, China)

Abstract

Combined conventional ground transport with a subway system for line-haul transport for intra-city express delivery is a new transportation mode. Subway transportation can be used in the line-haul transportation of intra-city express delivery services to reduce cost, improve efficiency, raise customer satisfaction, and alleviate road congestion and air pollution. To achieve this, we developed a path optimization model (POM) with time windows for intra-city express delivery, which makes use of the subway system. Our model integrated the subway system with ground transportation in order to minimize the total delivery time. It considered the time window requirements of the senders and the recipients, and was constrained by the frequency of trains on the subway line. To solve the POM, we designed a genetic algorithm. The model was tested in a case study of a courier company in Shanghai, China. Meanwhile, based on the basic scenario, the corresponding solutions of the four different scenarios of the model are carried out. Then, we further analyzed the influence of the number of vehicles, the frequency of trains on the subway line, and the client delivery time window on the total delivery time, client time window satisfaction, and courier company costs based on the basic scenario. The results demonstrated that the total delivery time and the total time outside the time window decreased as the number of vehicles increased; the total delivery time and the total time outside the time window decreased as the delivery frequency along the subway line increased; the total delivery time and the total time outside the time window decreased as the sender’s time window increased. However, when the sender’s time window increased beyond a certain threshold, the total delivery time and the total time outside the time window no longer decreased greatly. The case study results can guide courier companies in path optimization for intra-city express delivery vehicles in combination with the subway network.

Suggested Citation

  • Laijun Zhao & Xiaoli Wang & Johan Stoeter & Yan Sun & Huiyong Li & Qingmi Hu & Meichen Li, 2019. "Path Optimization Model for Intra-City Express Delivery in Combination with Subway System and Ground Transportation," Sustainability, MDPI, vol. 11(3), pages 1-25, February.
    • Handle: RePEc:gam:jsusta:v:11:y:2019:i:3:p:758-:d:202497
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. M. L. Balinski & R. E. Quandt, 1964. "On an Integer Program for a Delivery Problem," Operations Research, INFORMS, vol. 12(2), pages 300-304, April.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. Egbunike, Obiajulu N. & Potter, Andrew T., 2011. "Are freight pipelines a pipe dream? A critical review of the UK and European perspective," Journal of Transport Geography, Elsevier, vol. 19(4), pages 499-508.
    4. Guido Perboli & Roberto Tadei & Daniele Vigo, 2011. "The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics," Transportation Science, INFORMS, vol. 45(3), pages 364-380, August.
    5. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    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. Mateusz Szarata & Piotr Olszewski & Lesław Bichajło, 2021. "Simulation Study of Dynamic Bus Lane Concept," Sustainability, MDPI, vol. 13(3), pages 1-15, January.

    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. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    2. Gilbert Laporte, 2007. "What you should know about the vehicle routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 811-819, December.
    3. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    4. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    5. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    6. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    7. 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.
    8. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    9. Srinivas, Sharan & Ramachandiran, Surya & Rajendran, Suchithra, 2022. "Autonomous robot-driven deliveries: A review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    10. Loske, Dominic & Klumpp, Matthias, 2021. "Human-AI collaboration in route planning: An empirical efficiency-based analysis in retail logistics," International Journal of Production Economics, Elsevier, vol. 241(C).
    11. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    12. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    13. 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.
    14. 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.
    15. Muyldermans, L. & Pang, G., 2010. "On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm," European Journal of Operational Research, Elsevier, vol. 206(1), pages 93-103, October.
    16. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    17. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, vol. 175(1), pages 159-175, March.
    18. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2015. "A column generation approach for a multi-attribute vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 888-906.
    19. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    20. 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.

    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:11:y:2019:i:3:p:758-:d:202497. 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.