IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v68y2022i1p280-299.html
   My bibliography  Save this article

The Value of Autonomous Vehicles for Last-Mile Deliveries in Urban Environments

Author

Listed:
  • Sara Reed

    (Applied Mathematical and Computational Sciences, University of Iowa, Iowa City, Iowa 52242)

  • Ann Melissa Campbell

    (Department of Business Analytics, University of Iowa, Iowa City, Iowa 52242)

  • Barrett W. Thomas

    (Department of Business Analytics, University of Iowa, Iowa City, Iowa 52242)

Abstract

We demonstrate that autonomous-assisted delivery can yield significant improvements relative to today’s system in which a delivery person must park the vehicle before delivering packages. We model an autonomous vehicle that can drop off the delivery person at selected points in the city where the delivery person makes deliveries to the final addresses on foot. Then, the vehicle picks up the delivery person and travels to the next reloading point. In this way, the delivery person would never need to look for parking or walk back to a parking place. Based on the number of customers, driving speed of the vehicle, walking speed of the delivery person, and the time for loading packages, we characterize the optimal solution to the autonomous case on a solid rectangular grid of customers, showing the optimal solution can be found in polynomial time. To benchmark the completion time of the autonomous case, we introduce a traditional model for package delivery services that includes the time to search for parking. If the time to find parking is ignored, we show the introduction of an autonomous vehicle reduces the completion time of delivery to all customers by 0%–33%. When nonzero times to find parking are considered, the delivery person saves 30%–77% with higher values achieved for longer parking times, smaller capacities, and lower fixed time for loading packages.

Suggested Citation

  • Sara Reed & Ann Melissa Campbell & Barrett W. Thomas, 2022. "The Value of Autonomous Vehicles for Last-Mile Deliveries in Urban Environments," Management Science, INFORMS, vol. 68(1), pages 280-299, January.
    • Handle: RePEc:inm:ormnsc:v:68:y:2022:i:1:p:280-299
    DOI: 10.1287/mnsc.2020.3917
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2020.3917
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2020.3917?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. Boysen, Nils & Schwerdfeger, Stefan & Weidinger, Felix, 2018. "Scheduling last-mile deliveries with truck-based autonomous robots," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 126189, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Thu Ba T. Nguyê˜n & Tolga Bektaş & Tom J. Cherrett & Fraser N. McLeod & Julian Allen & Oliver Bates & Marzena Piotrowska & Maja Piecyk & Adrian Friday & Sarah Wise, 2019. "Optimising parcel deliveries in London using dual-mode routing," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(6), pages 998-1010, June.
    3. Iman Dayarian & Martin Savelsbergh & John-Paul Clarke, 2020. "Same-Day Delivery with Drone Resupply," Transportation Science, INFORMS, vol. 54(1), pages 229-249, January.
    4. Behnam Behdani & J. Cole Smith, 2014. "An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 415-432, August.
    5. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    6. Stefan Poikonen & Bruce Golden, 2020. "The Mothership and Drone Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 249-262, April.
    7. Boysen, Nils & Schwerdfeger, Stefan & Weidinger, Felix, 2018. "Scheduling last-mile deliveries with truck-based autonomous robots," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1085-1099.
    8. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, 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. Zang, Xiaoning & Jiang, Li & Liang, Changyong & Fang, Xiang, 2023. "Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).

    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. Yu, Shaohua & Puchinger, Jakob & Sun, Shudong, 2022. "Van-based robot hybrid pickup and delivery routing problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 894-914.
    2. Wang, Kai & Pesch, Erwin & Kress, Dominik & Fridman, Ilia & Boysen, Nils, 2022. "The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse," European Journal of Operational Research, Elsevier, vol. 296(2), pages 504-519.
    3. Ostermeier, Manuel & Heimfarth, Andreas & Hübner, Alexander, 2023. "The multi-vehicle truck-and-robot routing problem for last-mile delivery," European Journal of Operational Research, Elsevier, vol. 310(2), pages 680-697.
    4. Chen, Cheng & Demir, Emrah & Huang, Yuan, 2021. "An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1164-1180.
    5. Li, Hongqi & Chen, Jun & Wang, Feilong & Bai, Ming, 2021. "Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: A review," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1078-1095.
    6. Michael Dienstknecht & Nils Boysen & Dirk Briskorn, 2022. "The traveling salesman problem with drone resupply," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1045-1086, December.
    7. Zhao, Lei & Bi, Xinhua & Li, Gendao & Dong, Zhaohui & Xiao, Ni & Zhao, Anni, 2022. "Robust traveling salesman problem with multiple drones: Parcel delivery under uncertain navigation environments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    8. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    9. Schwerdfeger, Stefan & Boysen, Nils, 2020. "Optimizing the changing locations of mobile parcel lockers in last-mile distribution," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1077-1094.
    10. Chen, Cheng & Demir, Emrah & Huang, Yuan & Qiu, Rongzu, 2021. "The adoption of self-driving delivery robots in last mile logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    11. Lemardelé, Clément & Estrada, Miquel & Pagès, Laia & Bachofner, Mónika, 2021. "Potentialities of drones and ground autonomous delivery devices for last-mile logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    12. Wang, Xin & Huang, George Q., 2021. "When and how to share first-mile parcel collection service," European Journal of Operational Research, Elsevier, vol. 288(1), pages 153-169.
    13. Simoni, Michele D. & Kutanoglu, Erhan & Claudel, Christian G., 2020. "Optimization and analysis of a robot-assisted last mile delivery system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    14. Zhou, Hang & Qin, Hu & Cheng, Chun & Rousseau, Louis-Martin, 2023. "An exact algorithm for the two-echelon vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 124-150.
    15. Jiang, Jie & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services," European Journal of Operational Research, Elsevier, vol. 312(1), pages 125-137.
    16. Büyüközkan, Gülçin & Ilıcak, Öykü, 2022. "Smart urban logistics: Literature review and future directions," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    17. Nguyen, Minh Anh & Dang, Giang Thi-Huong & Hà, Minh Hoàng & Pham, Minh-Trien, 2022. "The min-cost parallel drone scheduling vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 299(3), pages 910-930.
    18. Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
    19. Heimfarth, Andreas & Ostermeier, Manuel & Hübner, Alexander, 2022. "A mixed truck and robot delivery approach for the daily supply of customers," European Journal of Operational Research, Elsevier, vol. 303(1), pages 401-421.
    20. 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.

    More about this item

    Keywords

    autonomous; routing; parking; grid;
    All these keywords.

    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:inm:ormnsc:v:68:y:2022:i:1:p:280-299. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.