Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science 2019
DOI: 10.1145/3357000.3366137
|View full text |Cite
|
Sign up to set email alerts
|

Shortest-Path Diversification through Network Penalization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 19 publications
0
13
0
Order By: Relevance
“…This optimal TWM provides static traffic assignment scenarios very close to the system optimum (SO) in terms of total travel time (TTS), though other optimality criteria may also be added in TWM calculus. Other similar works have appeared later, presenting a similar idea with randomized maps applied to different traffic networks [39].…”
Section: Introductionmentioning
confidence: 92%
“…This optimal TWM provides static traffic assignment scenarios very close to the system optimum (SO) in terms of total travel time (TTS), though other optimality criteria may also be added in TWM calculus. Other similar works have appeared later, presenting a similar idea with randomized maps applied to different traffic networks [39].…”
Section: Introductionmentioning
confidence: 92%
“…The so-formed multi-map (TWM) is distributed to traffic groups to create differentiated routing. Other related experiences have also pointed to map transformation procedures to generate alternative routes [43].…”
Section: Related Workmentioning
confidence: 99%
“…• Edge-penalty, where link weights are incremented iteratively for each shortest path found until k paths are found [43,[49][50][51].…”
Section: Related Workmentioning
confidence: 99%
“…In our work, the network also incorporates an arrival time function to capture time and load variations along edges, as well as the current and future state of the network. Route diversification is a common approach for congestion alleviation in road networks [6]. Barth and Funke [2] present a routing algorithm for a network of autonomous vehicles, by generating a set of viable alternative routes and then assigning one for each query.…”
Section: Related Workmentioning
confidence: 99%
“…This approach considers each individual vehicle (rather than as a collective optimization problem) and assigns the routes randomly. An alternative approach is to adapt Yen's top-𝑘 shortest paths algorithm [32] and select paths with high spatial diversity and low cost diversity [6]. This approach seeks to optimize a single query but does not address the collective routing of multiple queries for different origins/destinations.…”
Section: Related Workmentioning
confidence: 99%