IDEAS home Printed from https://ideas.repec.org/a/wly/transj/v62y2023i2p177-208.html

An On‐Demand Dynamic Taxi Crowdshipping Model for Urban Parcel Delivery

Author

Listed:
  • Amirhossein Baghestani
  • Shirin Najafabadi
  • Mahdieh Allahviranloo

Abstract

In this article, a dynamic crowdshipping model is presented to use the vacant space of taxis to deliver parcels while serving passengers. A mixed integer linear programming (MILP) model within a rolling horizon framework that periodically updates input information is formulated. The objective function aims to maximize the number of matched trips while controlling the total travel time in the system. The developed model is tested using the taxi ridership and the household travel survey data in New York City, ensuring the credibility of the proposed model in addressing the goals of the study and its potential application to mitigate transportation externalities.

Suggested Citation

  • Amirhossein Baghestani & Shirin Najafabadi & Mahdieh Allahviranloo, 2023. "An On‐Demand Dynamic Taxi Crowdshipping Model for Urban Parcel Delivery," Transportation Journal, John Wiley & Sons, vol. 62(2), pages 177-208, April.
    • Handle: RePEc:wly:transj:v:62:y:2023:i:2:p:177-208
    DOI: 10.5325/transportationj.62.2.0177
    as

    Download full text from publisher

    File URL: https://doi.org/10.5325/transportationj.62.2.0177
    Download Restriction: no
    File URL: https://libkey.io/10.5325/transportationj.62.2.0177?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
    ---><---

    References listed on IDEAS

    as
    1. Behrend, Moritz & Meisel, Frank, 2018. "The integration of item-sharing and crowdshipping: Can collaborative consumption be pushed by delivering through the crowd?," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 227-243.
    2. Bhat, Chandra R. & Eluru, Naveen, 2009. "A copula-based approach to accommodate residential self-selection effects in travel behavior modeling," Transportation Research Part B: Methodological, Elsevier, vol. 43(7), pages 749-765, August.
    3. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    4. Trivedi, Pravin K. & Zimmer, David M., 2007. "Copula Modeling: An Introduction for Practitioners," Foundations and Trends(R) in Econometrics, now publishers, vol. 1(1), pages 1-111, April.
    5. Chao Chen & Shenle Pan & Zhu Wang & Ray Y. Zhong, 2017. "Using taxis to collect citywide E-commerce reverse flows: a crowdsourcing solution," International Journal of Production Research, Taylor & Francis Journals, vol. 55(7), pages 1833-1844, April.
    6. Chao Chen & Shenle Pan & Zhu Wang & Ray Y. Zhong, 2017. "Using taxis to collect citywide E-commerce reverse flows: a crowdsourcing solution," Post-Print hal-01300487, HAL.
    7. Arslan, A.M. & Agatz, N.A.H. & Kroon, L.G. & Zuidwijk, R.A., 2016. "Crowdsourced Delivery: A Dynamic Pickup and Delivery Problem with Ad-hoc Drivers," ERIM Report Series Research in Management ERS-2016-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    8. Archetti, Claudia & Savelsbergh, Martin & Speranza, M. Grazia, 2016. "The Vehicle Routing Problem with Occasional Drivers," European Journal of Operational Research, Elsevier, vol. 254(2), pages 472-480.
    9. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    10. Shen, Hui & Lin, Jane, 2020. "Investigation of crowdshipping delivery trip production with real-world data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    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. Lin Zhou & Yanping Chen & Yi Jing & Youwei Jiang, 2021. "Evolutionary Game Analysis on Last Mile Delivery Resource Integration—Exploring the Behavioral Strategies between Logistics Service Providers, Property Service Companies and Customers," Sustainability, MDPI, vol. 13(21), pages 1-18, November.
    2. 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.
    3. Nieto-Isaza, Santiago & Fontaine, Pirmin & Minner, Stefan, 2022. "The value of stochastic crowd resources and strategic location of mini-depots for last-mile delivery: A Benders decomposition approach," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 62-79.
    4. Yang, Dingtong & Hyland, Michael F. & Jayakrishnan, R., 2024. "Tackling the crowdsourced shared-trip delivery problem at scale with a novel decomposition heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    5. Stokkink, Patrick & Cordeau, Jean-François & Geroliminis, Nikolas, 2024. "A column and row generation approach to the crowd-shipping problem with transfers," Omega, Elsevier, vol. 128(C).
    6. Martin Savelsbergh & Marlin W. Ulmer, 2024. "Challenges and opportunities in crowdsourced delivery planning and operations—an update," Annals of Operations Research, Springer, vol. 343(2), pages 639-661, December.
    7. Alireza Ermagun & Ali Shamshiripour & Amanda Stathopoulos, 2020. "Performance analysis of crowd-shipping in urban and suburban areas," Transportation, Springer, vol. 47(4), pages 1955-1985, August.
    8. Martin W.P Savelsbergh & Marlin W. Ulmer, 2022. "Challenges and opportunities in crowdsourced delivery planning and operations," 4OR, Springer, vol. 20(1), pages 1-21, March.
    9. Ermagun, Alireza & Stathopoulos, Amanda, 2018. "To bid or not to bid: An empirical study of the supply determinants of crowd-shipping," Transportation Research Part A: Policy and Practice, Elsevier, vol. 116(C), pages 468-483.
    10. Punel, Aymeric & Stathopoulos, Amanda, 2017. "Modeling the acceptability of crowdsourced goods deliveries: Role of context and experience effects," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 18-38.
    11. Yıldız, Barış, 2021. "Package routing problem with registered couriers and stochastic demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    12. Alexander Wyrowski & Nils Boysen & Dirk Briskorn & Stefan Schwerdfeger, 2024. "Public transport crowdshipping: moving shipments among parcel lockers located at public transport stations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 873-907, September.
    13. 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.
    14. Marlin Ulmer & Martin Savelsbergh, 2020. "Workforce Scheduling in the Era of Crowdsourced Delivery," Transportation Science, INFORMS, vol. 54(4), pages 1113-1133, July.
    15. 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.
    16. Shanyong Wang & Shiqiang Li & Haonan He & Qi Zhou, 2025. "Flexible supply-demand matching mechanism for C2B crowdsourcing logistics platforms with heterogeneous environment-inclined merchants," Annals of Operations Research, Springer, vol. 355(2), pages 1457-1481, December.
    17. Behrend, Moritz & Meisel, Frank, 2018. "The integration of item-sharing and crowdshipping: Can collaborative consumption be pushed by delivering through the crowd?," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 227-243.
    18. Boysen, Nils & Emde, Simon & Schwerdfeger, Stefan, 2022. "Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand," European Journal of Operational Research, Elsevier, vol. 296(2), pages 539-556.
    19. Behrend, Moritz & Meisel, Frank & Fagerholt, Kjetil & Andersson, Henrik, 2021. "A multi-period analysis of the integrated item-sharing and crowdshipping problem," European Journal of Operational Research, Elsevier, vol. 292(2), pages 483-499.
    20. Wang, Li & Xu, Min & Qin, Hu, 2023. "Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 111-135.

    More about this item

    Statistics

    Access and download statistics

    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:wly:transj:v:62:y:2023:i:2:p:177-208. 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: Wiley Content Delivery (email available below). General contact details of provider: .

    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.