IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i5d10.1007_s10878-020-00615-y.html
   My bibliography  Save this article

Online pickup and delivery problem with constrained capacity to minimize latency

Author

Listed:
  • Haiyan Yu

    (Chongqing Jiaotong University)

  • Xianwei Luo

    (Chongqing Jiaotong University)

  • Tengyu Wu

    (Chongqing University of Posts and Telecommunication)

Abstract

The online pickup and delivery problem is motivated by the takeaway order delivery on crowdsourcing delivery platform, which is a newly emerged online to offline business model based on sharing economy. Considering the features of crowdsourcing delivery, an online pickup and delivery problem with constrained capacity is proposed, whose objective is to route a delivery man with constrained capacity to serve requests released over time so as to minimize the total latency. We consider online point-to-point requests with single pickup location where each request has to be picked up at the single pickup location and delivered to its destination, and each request become available at its release time, which is not known in advance. The lower bound of this problem for various capacities is proved. Two online algorithms WR and WI are presented, the competitive ratios on a half line and on general metric space are proved respectively. Further, a computational study is conducted to compare the performance of these two online algorithms on random instances of general metric space. The result shows algorithm WR performs better than WI in random cases but not in the worst case.

Suggested Citation

  • Haiyan Yu & Xianwei Luo & Tengyu Wu, 2022. "Online pickup and delivery problem with constrained capacity to minimize latency," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 974-993, July.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00615-y
    DOI: 10.1007/s10878-020-00615-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00615-y
    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-020-00615-y?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. 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.
    2. Wang, Yuan & Zhang, Dongxiang & Liu, Qing & Shen, Fumin & Lee, Loo Hay, 2016. "Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 279-293.
    3. Devari, Aashwinikumar & Nikolaev, Alexander G. & He, Qing, 2017. "Crowdsourcing the last mile delivery of online orders by exploiting the social networks of retail store customers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 105-122.
    4. Paquette, Julie & Cordeau, Jean-François & Laporte, Gilbert & Pascoal, Marta M.B., 2013. "Combining multicriteria analysis and tabu search for dial-a-ride problems," Transportation Research Part B: Methodological, Elsevier, vol. 52(C), pages 1-16.
    Full references (including those not matched with items on IDEAS)

    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. Haiyan Yu & Xianwei Luo & Tengyu Wu, 0. "Online pickup and delivery problem with constrained capacity to minimize latency," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    2. Behrend, Moritz & Meisel, Frank & Fagerholt, Kjetil & Andersson, Henrik, 2019. "An exact solution method for the capacitated item-sharing and crowdshipping problem," European Journal of Operational Research, Elsevier, vol. 279(2), pages 589-604.
    3. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    4. Pourrahmani, Elham & Jaller, Miguel, 2021. "Crowdshipping in last mile deliveries: Operational challenges and research opportunities," Socio-Economic Planning Sciences, Elsevier, vol. 78(C).
    5. Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
    6. 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.
    7. Marlin Ulmer & Martin Savelsbergh, 2020. "Workforce Scheduling in the Era of Crowdsourced Delivery," Transportation Science, INFORMS, vol. 54(4), pages 1113-1133, July.
    8. Bathke, Henrik & Hartmann, Evi, 2021. "Accepting a crowdsourced delivery - A choice-based conjoint analysis," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Jahn, Carlos & Kersten, Wolfgang & Ringle, Christian M. (ed.), Adapting to the Future: Maritime and City Logistics in the Context of Digitalization and Sustainability. Proceedings of the Hamburg International Conf, volume 32, pages 65-95, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    9. Xiao, Fei & Wang, Haijun & Guo, Shuojia & Guan, Xu & Liu, Baoshan, 2021. "Efficient and truthful multi-attribute auctions for crowdsourced delivery," International Journal of Production Economics, Elsevier, vol. 240(C).
    10. Agnieszka Szmelter-Jarosz & Jagienka Rześny-Cieplińska, 2019. "Priorities of Urban Transport System Stakeholders According to Crowd Logistics Solutions in City Areas. A Sustainability Perspective," Sustainability, MDPI, vol. 12(1), pages 1-19, December.
    11. Fernanda Alves de Araújo & João Gilberto Mendes dos Reis & Marcia Terra da Silva & Emel Aktas, 2022. "A Fuzzy Analytic Hierarchy Process Model to Evaluate Logistics Service Expectations and Delivery Methods in Last-Mile Delivery in Brazil," Sustainability, MDPI, vol. 14(10), pages 1-18, May.
    12. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
    13. Raúl Martín-Santamaría & Ana D. López-Sánchez & María Luisa Delgado-Jalón & J. Manuel Colmenar, 2021. "An Efficient Algorithm for Crowd Logistics Optimization," Mathematics, MDPI, vol. 9(5), pages 1-19, March.
    14. Wang, Haibo & Alidaee, Bahram, 2023. "White-glove service delivery: A quantitative analysis," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    15. Nils Boysen & Stefan Fedtke & Stefan Schwerdfeger, 2021. "Last-mile delivery concepts: a survey from an operational research perspective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 1-58, March.
    16. Hou, Ting & Zhang, Wen, 2021. "Optimal two-stage elimination contests for crowdsourcing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    17. John Olsson & Daniel Hellström & Henrik Pålsson, 2019. "Framework of Last Mile Logistics Research: A Systematic Review of the Literature," Sustainability, MDPI, vol. 11(24), pages 1-25, December.
    18. Lijuan Huang & Guojie Xie & John Blenkinsopp & Raoyi Huang & Hou Bin, 2020. "Crowdsourcing for Sustainable Urban Logistics: Exploring the Factors Influencing Crowd Workers’ Participative Behavior," Sustainability, MDPI, vol. 12(8), pages 1-20, April.
    19. Tapia, Rodrigo J. & Kourounioti, Ioanna & Thoen, Sebastian & de Bok, Michiel & Tavasszy, Lori, 2023. "A disaggregate model of passenger-freight matching in crowdshipping services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 169(C).
    20. Jagienka Rześny-Cieplińska & Agnieszka Szmelter-Jarosz, 2019. "Assessment of the Crowd Logistics Solutions—The Stakeholders’ Analysis Approach," Sustainability, MDPI, vol. 11(19), pages 1-26, September.

    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:43:y:2022:i:5:d:10.1007_s10878-020-00615-y. 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.