Evaluating link and path incentives: Which is the most effective strategy for mitigating traffic congestion?
No Thumbnail Available
Access rights
embargoedAccess
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2025-01
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
Abstract
This study investigates the potential of link- and path-based incentives to mitigate congestion in urban transportation networks. Both incentive schemes are formulated as non-linear optimisation problems with complementarity constraints. Mathematically, it is demonstrated that the feasible region of the link-based model is a subset of the feasible region of the path-based model. Consequently, path-based incentives exhibit greater potential for shifting the user equilibrium flow pattern toward system optimum compared to link incentives. A column generation-based iterative solution technique, which generates new paths at each iteration, is devised to efficiently solve both optimisation problems. Numerical experiments conducted for various transport networks also highlight the superiority of path-based incentives in reducing total travel time in urban transportation networks.Description
Keywords
Incentive scheme, System optimum, Traffic assignment, Traffic management
Other note
Citation
Niroumand, R, Vosough, S, Roncoli, C, Rinaldi, M & Connors, R 2025, ' Evaluating link and path incentives: Which is the most effective strategy for mitigating traffic congestion? ', Paper presented at Transportation Research Board Annual Meeting, Washington, United States, 05/01/2025 - 09/01/2025 . < https://research.tudelft.nl/en/publications/evaluating-link-and-path-incentives-which-is-the-most-effective-s >