IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v212y2026ics1366554526002371.html

Policies for the dynamic same-day delivery problem with walking and parking

Author

Listed:
  • Scherr, Ninja
  • Reed, Sara
  • Campbell, Ann Melissa
  • Thomas, Barrett W.

Abstract

A key decision in the dynamic setting of same-day delivery is when to dispatch the vehicle and provide last-mile delivery service to continuously arriving customer requests. To understand successful strategies in urban environments, we introduce the Same-Day Delivery Problem with Walking and Parking (SDDPWP). We model this problem as a Markov Decision Process and develop solution policies that consider waiting for customers to accumulate and specified consolidation levels at parking spots. Our computational results clearly demonstrate that including parking and walking times matter in same-day delivery, with the best solutions recommending drivers wait at the depot to achieve consolidation of multiple customers into walking routes from each parking spot. We find a significant percentage of waiting time occurs at the beginning of the day and provide managerial insights as to how to mitigate this inefficiency in labor utilization to improve profits by as much as 60%.

Suggested Citation

  • Scherr, Ninja & Reed, Sara & Campbell, Ann Melissa & Thomas, Barrett W., 2026. "Policies for the dynamic same-day delivery problem with walking and parking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 212(C).
    • Handle: RePEc:eee:transe:v:212:y:2026:i:c:s1366554526002371
    DOI: 10.1016/j.tre.2026.104898
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526002371
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2026.104898?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

    for a different version of it.

    More about this item

    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:eee:transe:v:212:y:2026:i:c:s1366554526002371. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.