On determining the weight of edges in map-representing graphs-applications of heuristic methods in planning escape routes
In the paper we discuss and compare two commonly used methods of finding the shortest paths in networks, namely Dijkstra's and A∗ algorithms. We compare their effectiveness in terms of traversing road network in circumstances that require swift decision making in the event of dynamically changi...
Main Authors: | Marta Borowska-Stefańska, Michał Kowalski, Filip Turoboś, Szymon Wiśniewski |
---|---|
Format: | Article |
Language: | English |
Published: |
KeAi Communications Co., Ltd.
2022-12-01
|
Series: | Journal of Traffic and Transportation Engineering (English ed. Online) |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2095756422001039 |
Similar Items
-
Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks
by: Dominik Köppl
Published: (2022-03-01) -
Classification and calculation of the best escape route of coal mine based on Dijkstra algorithm
by: TONG Xing, et al.
Published: (2018-04-01) -
A Heuristic Integrated Scheduling Algorithm Based on Improved Dijkstra Algorithm
by: Pengwei Zhou, et al.
Published: (2023-10-01) -
Distribution Path Segmentation Using Route Relocation and Savings Heuristics for Multi-Depot Vehicle Routing
by: Farid Morsidi
Published: (2023-05-01) -
A Geographical Heuristic Routing Protocol for VANETs
by: Luis Urquiza-Aguiar, et al.
Published: (2016-09-01)