Finding Shortest Path in Road Networks Based on Jam-Distance Graph and Dijkstra’s Algorithm

Ali, Sarah Fouad; Abdulrazzaq, Musaab Riyadh; Gaata, Methaq Talib

doi:10.1007/978-981-19-1412-6_40

Cited by 2 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A large number of specialists and researchers have carried out extensive studies on path analysis algorithms, with the Dijkstra algorithm [12][13][14][15][16][17] and the A* algorithm [18][19][20][21][22][23][24] standing out as the most representative. The majority of these studies have primarily focused on a single transportation network.…”

Section: Introductionmentioning

confidence: 99%

Application of an Improved A* Algorithm for the Path Analysis of Urban Multi-Type Transportation Systems

Feng,

Zhang,

Zhu

2023

Applied Sciences

View full text Add to dashboard Cite

The modern urban transportation service network could be split into unrestricted and restricted networks depending on whether travelers face limitations in route selection. Along with the continuous expansion of the city, it is difficult for travelers to find a more reasonable travel solution when confronted with such a complex transportation service network, which combines both unrestricted and restricted networks, especially for the park-and-ride (P&R) travel mode. This paper addresses the issue of route analysis in modern urban transportation service systems to provide travelers with reasonable travel solutions based on multiple types of transportation services. An improved A* algorithm is proposed to address the optimal path analysis for restricted networks to provide reasonable travel solutions for public transportation trips. Furthermore, by establishing the topological relationship between restricted and unrestricted networks, this paper presented an improved A* algorithm based on hybrid networks that solves the optimal path analysis problem for P&R trips, bringing convenience to many urban travelers.

show abstract