IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v6y2025i2d10.1007_s43069-025-00467-4.html
   My bibliography  Save this article

Time-Dependent Routing and Road Network Precision

Author

Listed:
  • Rabie Jaballah

    (Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT)
    Faculté des Sciences de l’Administration, Université Laval)

  • Leandro C. Coelho

    (Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT)
    Faculté des Sciences de l’Administration, Université Laval
    Canada Research Chair in Integrated Logistics)

  • Jacques Renaud

    (Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT)
    Faculté des Sciences de l’Administration, Université Laval
    Centre d’Innovation en Logistique et Chaînes d’Approvisionnement Durables)

Abstract

In many industries, data changed the way decisions are made, driving performance and competitiveness. Transportation and logistics are no exception. Companies are analyzing data from their vehicles to improve driving behavior, optimize transportation routes, and improve their operations. Over the years, vehicle routing problems (VRPs) were solved with the assumption that each pair of customers is connected by a single arc with a constant travel time. With the vast availability of data, one can now solve the time-dependent shortest path VRP (TD-SPVRP) which is a TD-VRP modeled on a real road network and where each pair of customers is connected by numerous time-varying paths. This increased the precision but also the complexity related to the size of the network. In this paper, we evaluate the impact of the road network precision on the problem and its solution. When the highest level of precision is required, one needs to work on the complete network but at the cost of a much more difficult problem. On the other hand, low computing effort is needed when working only with the customer nodes but at the cost of losing precision. We discuss some network reduction procedures to reduce the graph size. We evaluate the reduction procedures on real data instances using multiple heuristics and a metaheuristic that can be used to solve the TD-SPVRP and the TD-VRP. This allows us to evaluate the impact of the graph size and its structure on the quality of the solutions, their precision, and the computational effort.

Suggested Citation

  • Rabie Jaballah & Leandro C. Coelho & Jacques Renaud, 2025. "Time-Dependent Routing and Road Network Precision," SN Operations Research Forum, Springer, vol. 6(2), pages 1-23, June.
    • Handle: RePEc:spr:snopef:v:6:y:2025:i:2:d:10.1007_s43069-025-00467-4
    DOI: 10.1007/s43069-025-00467-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-025-00467-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-025-00467-4?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:spr:snopef:v:6:y:2025:i:2:d:10.1007_s43069-025-00467-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.