IDEAS home Printed from https://ideas.repec.org/p/cdl/itsdav/qt8rw99523.html
   My bibliography  Save this paper

Optimizing Fuel Consumption and Pollutant Emissions in Truck Routing with Parking Availability Prediction and Working Hours Constraints

Author

Listed:
  • Vital, Filipe
  • Ioannou, Petros

Abstract

The transportation sector is responsible for a significant part of the U.S.’s greenhouse emissions, with a considerable amount being generated by medium-and heavy-duty trucks. However, when it comes to the trucking industry, ‘green’ routing studies do not consider other critical practical factors, like working hours regulations and parking availability. Due to parking shortages, routes and schedules that do not account for parking availability may lead to last-minute changes that make them more polluting than expected. Similarly, working hours regulations influence the timing of required rest stops, which may force drivers to deviate from initially selected routes and schedules with negative consequences to fuel consumption and emissions. This study addresses a variant of the shortest path and truck driver scheduling problem under parking availability constraints which focuses on optimizing fuel consumption and emissions by controlling the truck's travel speed and accounting for time-dependent traffic conditions. As it is impossible to be absolutely certain about the future parking availability of any location during planning, the case of stochastic parking availability was also studied. When studying the trade-offs between prioritizing emissions reduction or trip duration, it was found that although focusing on emissions reduction can increase trip duration significantly, this impact is greatly reduced when considering scenarios with limited parking availability. The problem formulation was further extended to model drivers’ possible recourse actions when unable to find parking and the ensuing costs. This formulation was used to study how the solutions are affected by the level of information provided to drivers. It was found that ignoring uncertainty in parking availability results in inconsistent performance even when restricting parking to periods when probability of finding parking is high. Furthermore, results might not reflect the intent of the cost function used, e.g., minimizing illegal parking events and/or the priority assigned to emissions reduction. Giving drivers full information about the probability of finding parking at any time/location significantly improves performance and reduces illegal parking-related risks, but also substantially increase problem complexity and computation time. Using full information regarding parking availability but restricting the parking times to high availability time-windows can reduce complexity while maintaining consistent, although reduced, performance. View the NCST Project Webpage

Suggested Citation

  • 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.
  • Handle: RePEc:cdl:itsdav:qt8rw99523
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/8rw99523.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    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. 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.
    3. Ç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.
    4. Zhang, Jianghua & Zhao, Yingxue & Xue, Weili & Li, Jin, 2015. "Vehicle routing problem with fuel consumption and carbon emission," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 234-242.
    5. 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.
    6. Remy Spliet & Said Dabia & Tom Van Woensel, 2018. "The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 52(2), pages 261-276, March.
    7. 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.
    8. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    5. 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.
    6. 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.
    7. 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).
    8. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    9. 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.
    10. 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).
    11. Thomas R. Visser & Remy Spliet, 2020. "Efficient Move Evaluations for Time-Dependent Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(4), pages 1091-1112, July.
    12. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    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. 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.
    15. Xu, Shuling & Hall, Nicholas G., 2021. "Fatigue, personnel scheduling and operations: Review and research opportunities," European Journal of Operational Research, Elsevier, vol. 295(3), pages 807-822.
    16. 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.
    17. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    18. Bernhardt, A. & Melo, Teresa & Bousonville, Thomas & Kopfer, Herbert, 2016. "Scheduling of driver activities with multiple soft time windows considering European regulations on rest periods and breaks," Technical Reports on Logistics of the Saarland Business School 12, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    19. Alcaraz, Juan J. & Caballero-Arnaldos, Luis & Vales-Alonso, Javier, 2019. "Rich vehicle routing problem with last-mile outsourcing decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 263-286.
    20. 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.

    More about this item

    Keywords

    Engineering; Fuel consumption; Hours of labor; Parking; Pollutants; Routes and routing; Truck traffic;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cdl:itsdav:qt8rw99523. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucdus.html .

    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.