The Vehicle Routing Problem with Access Restrictions
Transportation Science · 2024-09 · 58 (5) · 1101-1120
DOI: 10.1287/trsc.2023.0261 ↗Kurz gefasst
Fachartikel in der Zeitschrift Transportation Science, 2024-09. Verfasst von Munise Kübra Şahin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 21 Literaturangaben.
Abstract (Originalsprache)
To mitigate the negative effects of freight vehicles on urban areas, many cities have implemented road accessibility restrictions, including limited traffic zones, which restrict access to specific areas during certain times of the day. Implementing these zones creates a tradeoff between the delivery cost and time, even under the assumption of equal traversal time and travel cost. Consequently, the planners in charge of vehicle routing need to work with graphs containing information on all Pareto-optimal paths. Inspired by these changes in city logistics and the resulting computational challenges, we study the vehicle routing problem with access restrictions, where some streets are closed to traffic within a given time period. We formulate this problem using workday variables and propose two branch and price algorithms based on the underlying road network and multigraph. The results of our computational experiments demonstrate the effectiveness of the proposed algorithms, solving instances with up to 100 nodes and 33 customers, and underline the importance of considering alternative paths in reducing costs. Funding: This work was supported by KU Leuven [C14/22/026].
Zitieren
APA
Şahin, M. K., & Yaman, H. (2024). The Vehicle Routing Problem with Access Restrictions. Transportation Science, 58(5), 1101-1120. https://doi.org/10.1287/trsc.2023.0261
Vancouver
Şahin MK, Yaman H. The Vehicle Routing Problem with Access Restrictions. Transportation Science. 2024;58(5):1101-1120. doi:10.1287/trsc.2023.0261
BibTeX
@article{ahin2024,
author = {Şahin, Munise Kübra and Yaman, Hande},
title = {The Vehicle Routing Problem with Access Restrictions},
journal = {Transportation Science},
year = {2024},
volume = {58},
number = {5},
pages = {1101--1120},
doi = {10.1287/trsc.2023.0261}
}
EUVIMED