Author
Abstract
Urban freight pickup-and-delivery services operate in road networks where travel times are highly variable due to congestion, incidents, and operational restrictions. Such variability threatens the punctuality of deliveries and complicates the design of reliable service schedules. This paper examines an urban pickup-and-delivery vehicle routing problem with soft time windows under travel-time uncertainty and provides an empirical comparison of robust and deterministic planning approaches on a real road network. The problem is formulated as a time-dependent pickup-and-delivery VRP with soft time windows, where link travel times are represented by a finite set of scenarios calibrated from observed network conditions. The objective function combines four components that are central to urban freight operations: total travel time, total distance, and penalties for earliness and lateness relative to customer time windows. This structure captures the trade-off between routing efficiency and service quality. On this basis, a robust model is constructed that optimises tour plans with respect to scenario-based worst-case or risk-aggregated costs, while a standard deterministic model minimises the same objective using nominal (average) travel times only. An empirical study on a real urban network compares the deterministic and robust solutions with respect to delivery punctuality, tour length, and time-window violations across a range of demand and variability settings. The results show that robust routing systematically reduces the frequency and magnitude of late deliveries at the expense of only moderate increases in planned distance and travel time. Although energy use and emissions are not modelled explicitly, the improved reliability and reduced need for reactive re-routing indicate a potential to support more reliable and resource-efficient urban freight operations in the context of sustainable city logistics.
Suggested Citation
Download full text from publisher
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:gam:jsusta:v:17:y:2025:i:24:p:11308-:d:1819949. 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: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address
(email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.