One-Shot Traffic Assignment with Forward-Looking Penalization

被引:4
作者
Cornacchia, Giuliano [1 ,2 ]
Nanni, Mirco [2 ]
Pappalardo, Luca [2 ]
机构
[1] Univ Pisa, Pisa, Italy
[2] CNR, ISTI, Pisa, Italy
来源
31ST ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS, ACM SIGSPATIAL GIS 2023 | 2023年
关键词
traffic assignment; alternative routing; route planning; path diversification; CO2; emissions; urban sustainability; ALGORITHM; PATHS;
D O I
10.1145/3589132.3625637
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Traffic assignment (TA) is crucial in optimizing transportation systems and consists in efficiently assigning routes to a collection of trips. Existing TA algorithms often do not adequately consider realtime traffic conditions, resulting in inefficient route assignments. This paper introduces METIS, a coordinated, one-shot TA algorithm that combines alternative routing with edge penalization and informed route scoring. We conduct experiments in several cities to evaluate the performance of METIS against state-of-the-art one-shot methods. Compared to the best baseline, METIS significantly reduces CO2 emissions by 18% in Milan, 28% in Florence, and 46% in Rome, improving trip distribution considerably while still having low computational time. Our study proposes METIS as a promising solution for optimizing TA and urban transportation systems.
引用
收藏
页码:490 / 499
页数:10
相关论文
共 33 条
[1]   K*: A heuristic search algorithm for finding the k shortest paths [J].
Aljazzar, Husain ;
Leue, Stefan .
ARTIFICIAL INTELLIGENCE, 2011, 175 (18) :2129-2154
[2]  
[Anonymous], 2000, Highway capacity manual
[3]  
[Anonymous], 2005, CHOIC ROUT
[4]  
Beckman M., 1956, OR, V7, P146, DOI DOI 10.2307/3007560
[5]   Gross polluters and vehicle emissions reduction [J].
Bohm, Matteo ;
Nanni, Mirco ;
Pappalardo, Luca .
NATURE SUSTAINABILITY, 2022, 5 (08) :699-+
[6]  
Bureau of Public Roads, 1964, TRAFF ASS MAN APPL L, V37
[7]  
Campbell M.E., 1950, Route selection and traffic assignment
[8]  
CHEN DKY, 2019, IWCTS SIGSPATIAL
[9]   A NETWORK DESIGN ALGORITHM USING A STOCHASTIC INCREMENTAL TRAFFIC ASSIGNMENT APPROACH [J].
CHEN, MY ;
ALFA, AS .
TRANSPORTATION SCIENCE, 1991, 25 (03) :215-224
[10]   Finding k-Dissimilar Paths with Minimum Collective Length [J].
Chondrogiannis, Theodoros ;
Bouros, Panagiotis ;
Gamper, Johann ;
Leser, Ulf ;
Blumenthal, David B. .
26TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2018), 2018, :404-407