IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v19y2019i2d10.1007_s11067-018-9385-2.html
   My bibliography  Save this article

An On-Demand Same-Day Delivery Service Using Direct Peer-to-Peer Transshipment Strategies

Author

Listed:
  • Wei Zhou

    (Jingdong (JD.com) Silicon Valley R&D Center)

  • Jane Lin

    (University of Illinois at Chicago
    University of Illinois at Chicago)

Abstract

As the same-day delivery service becomes increasingly popular among e-commerce customers, it demands fast, cheap, and flexible on-demand delivery service. This paper proposes, formulates, and evaluates a new on-demand, same-day delivery (ODSD) strategy using direct peer-to-peer transshipment (P2PT). P2PT involves package relays among multiple couriers to extend beyond the normal service range of a single courier; this is done directly via effective collaboration and coordination among couriers. Three P2PT variants are investigated in this paper: P2PT-1 with one single inter-zonal ODSD service request (pickup and delivery in two different service zones), P2PT-M with multiple inter-zonal ODSD requests, and P2PT-RT with real-time inter-zonal demand. An adaptive boundary relaxation (ABR) heuristic algorithm is proposed and evaluated for its solution performance. The P2PT delivery paradigm is also compared with the most responsive and naive ODSD strategy of direct shipping. It is found that while P2PT tends to incur longer travel time than direct shipping, it provides the ODSD service without having to expand and maintain a larger fleet of vehicles (and thus drivers) or incurring extra labor cost. As the economy of scale of ODSD demand increases, those advantages of P2PT will only become more prominent. Our investigations have also found that the efficiency of P2PT, measured by the additional travel time incurred per ODSD service request, improves initially with the economy of scale, and then seems to flatten out in the static demand scenario or worsen in the real-time demand scenario as the number of service requests increases.

Suggested Citation

  • Wei Zhou & Jane Lin, 2019. "An On-Demand Same-Day Delivery Service Using Direct Peer-to-Peer Transshipment Strategies," Networks and Spatial Economics, Springer, vol. 19(2), pages 409-443, June.
    • Handle: RePEc:kap:netspa:v:19:y:2019:i:2:d:10.1007_s11067-018-9385-2
    DOI: 10.1007/s11067-018-9385-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-018-9385-2
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-018-9385-2?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. Naoki Ando & Eiichi Taniguchi, 2006. "Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows," Networks and Spatial Economics, Springer, vol. 6(3), pages 293-311, September.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. Figliozzi, Miguel Andres, 2009. "Planning approximations to the average length of vehicle routing problems with time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 43(4), pages 438-447, May.
    4. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    5. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
    6. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    7. Campbell, James F., 1994. "Integer programming formulations of discrete hub location problems," European Journal of Operational Research, Elsevier, vol. 72(2), pages 387-405, January.
    8. David Escuín & Carlos Millán & Emilio Larrodé, 2012. "Modelization of Time-Dependent Urban Freight Problems by Using a Multiple Number of Distribution Centers," Networks and Spatial Economics, Springer, vol. 12(3), pages 321-336, September.
    9. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
    10. Carlos F. Daganzo, 2005. "Logistics Systems Analysis," Springer Books, Springer, edition 0, number 978-3-540-27516-9, February.
    11. Lawrence D. Burns & Randolph W. Hall & Dennis E. Blumenfeld & Carlos F. Daganzo, 1985. "Distribution Strategies that Minimize Transportation and Inventory Costs," Operations Research, INFORMS, vol. 33(3), pages 469-490, June.
    12. Junlong Zhang & William Lam & Bi Chen, 2013. "A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service," Networks and Spatial Economics, Springer, vol. 13(4), pages 471-496, December.
    13. Edoardo Marcucci & Romeo Danielis, 2008. "The potential demand for a urban freight consolidation centre," Transportation, Springer, vol. 35(2), pages 269-284, March.
    14. Liu, Jiyin & Li, Chung-Lun & Chan, Chun-Yan, 2003. "Mixed truck delivery systems with both hub-and-spoke and direct shipment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 39(4), pages 325-339, July.
    15. Melkote, Sanjay & Daskin, Mark S., 2001. "An integrated model of facility location and transportation network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(6), pages 515-538, July.
    16. Zapfel, Gunther & Wasner, Michael, 2002. "Planning and optimization of hub-and-spoke transportation networks of cooperative third-party logistics providers," International Journal of Production Economics, Elsevier, vol. 78(2), pages 207-220, July.
    17. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
    18. Figliozzi, Miguel Andres, 2010. "The impacts of congestion on commercial vehicle tour characteristics and costs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(4), pages 496-506, July.
    19. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
    20. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    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. Falkenberg, Sven F. & Spinler, Stefan & Strauss, Arne K., 2024. "An algorithm for flexible transshipments with perfect synchronization," European Journal of Operational Research, Elsevier, vol. 315(3), pages 913-925.

    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. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    2. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
    3. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    4. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    5. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    6. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    7. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    8. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    9. Michael Drexl, 2018. "On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers," Working Papers 1816, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    11. Michael Drexl, 2021. "On the one-to-one pickup-and-delivery problem with time windows and trailers," 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. 29(3), pages 1115-1162, September.
    12. Su, E. & Qin, Hu & Li, Jiliu & Pan, Kai, 2023. "An exact algorithm for the pickup and delivery problem with crowdsourced bids and transshipment," Transportation Research Part B: Methodological, Elsevier, vol. 177(C).
    13. Veaceslav Ghilas & Jean-François Cordeau & Emrah Demir & Tom Van Woensel, 2018. "Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines," Transportation Science, INFORMS, vol. 52(5), pages 1191-1210, October.
    14. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    15. Repoussis, Panagiotis P. & Tarantilis, Christos D. & Zachariadis, Emmanouil E., 2017. "Moving products between location pairs: Cross-docking versus direct-shippingAuthor-Name: Nikolopoulou, Amalia I," European Journal of Operational Research, Elsevier, vol. 256(3), pages 803-819.
    16. Yuan Qu & Jonathan F. Bard, 2015. "A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity," Transportation Science, INFORMS, vol. 49(2), pages 254-270, May.
    17. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2022. "Fleet sizing and routing of healthcare automated guided vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    18. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
    19. Lyu, Zefeng & Yu, Andrew Junfang, 2023. "The pickup and delivery problem with transshipments: Critical review of two existing models and a new formulation," European Journal of Operational Research, Elsevier, vol. 305(1), pages 260-270.
    20. Liu, Chuanju & Zhang, Junlong & Lin, Shaochong & Shen, Zuo-Jun Max, 2023. "Service network design with consistent multiple trips," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).

    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:kap:netspa:v:19:y:2019:i:2:d:10.1007_s11067-018-9385-2. 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.