IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v148y2021icp1-37.html
   My bibliography  Save this article

Scheduling and shortest path for trucks with working hours and parking availability constraints

Author

Listed:
  • Vital, Filipe
  • Ioannou, Petros

Abstract

The US Hours-of-Service (HOS) regulations require truck drivers to take regular breaks. However, drivers often have difficulty finding appropriate rest locations due to truck parking shortages. This may have a significant impact on drivers’ safety and productivity, cost to industry and environment. In this paper, we propose a model that takes into account parking availability when planning long-haul truck shipments in addition to HOS constraints. Given an ordered set of clients, the proposed method plans a minimum cost route and schedule such that the itinerary is regulation-compliant, and the driver is guaranteed to find parking at all scheduled stops. The problem is modeled as a shortest path problem with resource constraints, and a label correcting algorithm is used to generate optimal solutions. Computational experiments are used to compare the cost of solutions that use parking availability information with ones that do not. The cost of disregarding parking information was estimated by simulating drivers’ behavior when parking is unavailable and applying time and cost penalties. The effect of parking availability and alternative routes on trip costs is also studied, aiming to illustrate that disregarding these factors can lead to significant errors in cost estimates. Results show that, although imposing parking constraints can significantly increase costs, preventing accident-related costs can make it advantageous in the long-term.

Suggested Citation

  • Vital, Filipe & Ioannou, Petros, 2021. "Scheduling and shortest path for trucks with working hours and parking availability constraints," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 1-37.
    • Handle: RePEc:eee:transb:v:148:y:2021:i:c:p:1-37
    DOI: 10.1016/j.trb.2021.04.002
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. A. L. Kok & C. M. Meyer & H. Kopfer & J. M. J. Schutten, 2010. "A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation," Transportation Science, INFORMS, vol. 44(4), pages 442-454, November.
    2. Asvin Goel, 2010. "Truck Driver Scheduling in the European Union," Transportation Science, INFORMS, vol. 44(4), pages 429-441, November.
    3. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
    4. Mayerle, Sérgio Fernando & De Genaro Chiroli, Daiane Maria & Neiva de Figueiredo, João & Rodrigues, Hidelbrando Ferreira, 2020. "The long-haul full-load vehicle routing and truck driver scheduling problem with intermediate stops: An economic impact evaluation of Brazilian policy," Transportation Research Part A: Policy and Practice, Elsevier, vol. 140(C), pages 36-51.
    5. Leonardo Lozano & Daniel Duque & Andrés L. Medaglia, 2016. "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints," Transportation Science, INFORMS, vol. 50(1), pages 348-357, February.
    6. Çağrı Koç & Ola Jabali & Gilbert Laporte, 2018. "Long-haul vehicle routing and scheduling with idling options," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(2), pages 235-246, February.
    7. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    8. Asvin Goel & Leendert Kok, 2012. "Truck Driver Scheduling in the United States," Transportation Science, INFORMS, vol. 46(3), pages 317-326, August.
    9. Claudia Archetti & Martin Savelsbergh, 2009. "The Trip Scheduling Problem," Transportation Science, INFORMS, vol. 43(4), pages 417-431, November.
    10. Asvin Goel & Thibaut Vidal, 2014. "Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment," Transportation Science, INFORMS, vol. 48(3), pages 391-412, August.
    11. Kok, A.L. & Hans, E.W. & Schutten, J.M.J., 2011. "Optimizing departure times in vehicle routes," European Journal of Operational Research, Elsevier, vol. 210(3), pages 579-587, May.
    12. Asvin Goel & Stefan Irnich, 2017. "An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems," Transportation Science, INFORMS, vol. 51(2), pages 737-754, May.
    13. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "A comparison of three idling options in long-haul truck scheduling," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 631-647.
    14. Marie-Eve Rancourt & Jean-François Cordeau & Gilbert Laporte, 2013. "Long-Haul Vehicle Routing and Scheduling with Working Hour Rules," Transportation Science, INFORMS, vol. 47(1), pages 81-107, February.
    15. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    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. Igor Betkier & Elżbieta Macioszek, 2022. "Characteristics of Parking Lots Located along Main Roads in Terms of Cargo Truck Requirements: A Case Study of Poland," Sustainability, MDPI, vol. 14(23), pages 1-21, November.
    2. Marina Kouta & Yorgos Stephanedes, 2023. "Disaggregate Modelling for Estimating Location Choice of Safe and Secure Truck Parking Areas: A Case Study," Sustainability, MDPI, vol. 15(20), pages 1-20, October.
    3. Pilz, Danny & Schwerdfeger, Stefan & Boysen, Nils, 2022. "Make or break: Coordinated assignment of parking space for breaks and rest periods in long-haul trucking," Transportation Research Part B: Methodological, Elsevier, vol. 164(C), pages 45-64.
    4. Wu, Jishi & Feng, Tao & Jia, Peng & Li, Gen, 2024. "Spatial allocation of heavy commercial vehicles parking areas through geo-fencing," Journal of Transport Geography, Elsevier, vol. 117(C).
    5. Daiane Maria Genaro Chiroli & Sérgio Fernando Mayerle & João Neiva Figueiredo, 2022. "Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints," Journal of Heuristics, Springer, vol. 28(1), pages 23-59, February.

    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. Tilk, Christian & Goel, Asvin, 2020. "Bidirectional labeling for solving vehicle routing and truck driver scheduling problems," European Journal of Operational Research, Elsevier, vol. 283(1), pages 108-124.
    2. Christian Tilk & Asvin Goel, 2019. "Bidirectional labeling for solving vehicle routing and truck driver scheduling problems," Working Papers 1914, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    3. Ostermeier, Manuel, 2024. "The supply of convenience stores: Challenges of short-distance routing within the constraints of working time regulations," European Journal of Operational Research, Elsevier, vol. 314(3), pages 997-1012.
    4. Goel, Asvin, 2018. "Legal aspects in road transport optimization in Europe," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 144-162.
    5. Mor, Andrea & Archetti, Claudia & Jabali, Ola & Simonetto, Alberto & Speranza, M. Grazia, 2022. "The Bi-objective Long-haul Transportation Problem on a Road Network," Omega, Elsevier, vol. 106(C).
    6. Asvin Goel & Thibaut Vidal & Adrianus Leendert Kok, 2021. "To team up or not: single versus team driving in European road freight transport," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 879-913, December.
    7. Eskandarzadeh, Saman & Fahimnia, Behnam, 2022. "Rest break policy comparison for heavy vehicle drivers in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    8. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "A comparison of three idling options in long-haul truck scheduling," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 631-647.
    9. Asvin Goel & Stefan Irnich, 2017. "An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems," Transportation Science, INFORMS, vol. 51(2), pages 737-754, May.
    10. Pilz, Danny & Schwerdfeger, Stefan & Boysen, Nils, 2022. "Make or break: Coordinated assignment of parking space for breaks and rest periods in long-haul trucking," Transportation Research Part B: Methodological, Elsevier, vol. 164(C), pages 45-64.
    11. Daiane Maria Genaro Chiroli & Sérgio Fernando Mayerle & João Neiva Figueiredo, 2022. "Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints," Journal of Heuristics, Springer, vol. 28(1), pages 23-59, February.
    12. Vital, Filipe & Ioannou, Petros, 2022. "Optimizing Fuel Consumption and Pollutant Emissions in Truck Routing with Parking Availability Prediction and Working Hours Constraints," Institute of Transportation Studies, Working Paper Series qt8rw99523, Institute of Transportation Studies, UC Davis.
    13. Asvin Goel & Thibaut Vidal, 2014. "Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment," Transportation Science, INFORMS, vol. 48(3), pages 391-412, August.
    14. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    15. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    16. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    17. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    18. Marie-Eve Rancourt & Jean-François Cordeau & Gilbert Laporte, 2013. "Long-Haul Vehicle Routing and Scheduling with Working Hour Rules," Transportation Science, INFORMS, vol. 47(1), pages 81-107, February.
    19. Pottel, Steffen & Goel, Asvin, 2022. "Scheduling activities with time-dependent durations and resource consumptions," European Journal of Operational Research, Elsevier, vol. 301(2), pages 445-457.
    20. Stehbeck, Florian, 2019. "Designing and Scheduling Cost-Efficient Tours by Using the Concept of Truck Platooning," Junior Management Science (JUMS), Junior Management Science e. V., vol. 4(4), pages 566-634.

    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:transb:v:148:y:2021:i:c:p:1-37. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/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.