IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v190y2024ics0965856424003318.html
   My bibliography  Save this article

Optimizing freight delivery routes: The time-distance dilemma

Author

Listed:
  • Álvarez, Pablo
  • Serrano-Hernandez, Adrian
  • Lerga, Iosu
  • Faulin, Javier

Abstract

Traditional approaches to optimizing freight delivery routes are based on minimizing a distance-based cost function. New approaches also use time as an objective function to minimize. However, the trade-off between time and distance is sometimes unclear. This paper presents a new approach to route optimization in which both time and distance are considered conjointly. For this purpose, the vehicle operating cost and the value of time have been used to translate time and distance into monetary units. By studying three different networks in Spain with varying levels of detail (the region of Catalonia, the city of Barcelona, and the Pamplona city center), the results show that minimizing both time and distance yield better results than the traditional approach, especially at a local level, where congestion effects are more relevant. These findings are helpful for logistics companies to optimize their operations, as well as for public authorities who could employ these models to make decisions and create policies on logistics.

Suggested Citation

  • Álvarez, Pablo & Serrano-Hernandez, Adrian & Lerga, Iosu & Faulin, Javier, 2024. "Optimizing freight delivery routes: The time-distance dilemma," Transportation Research Part A: Policy and Practice, Elsevier, vol. 190(C).
    • Handle: RePEc:eee:transa:v:190:y:2024:i:c:s0965856424003318
    DOI: 10.1016/j.tra.2024.104283
    as

    Download full text from publisher

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

    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:transa:v:190:y:2024:i:c:s0965856424003318. 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/547/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.