The objective of the paper was to determine which search method is suitable for implementation in GPS systems. The properties of pathfinding algorithms were tested and discussed taking into account this type of systems. Six algorithms have been evaluated, including three different implementations of Dijkstra algorithm, Bellman-Ford algorithm, A* star algorithm, and bidirectional Dijkstra’s algorithm. Simulation experiments were carried out using the real digital maps and with the designed and implemented experimentation system. Studies were performed with respect to various parameters. After thorough examination and interpretation of conclusions, the algorithms which fit to GPS systems were selected. Keywords—GPS; search algorithms; experimentation system; path finding
[1]
Leszek Koszalka,et al.
Evolutionary Algorithm for Solving Congestion Problem in Computer Networks
,
2009,
KES.
[2]
Thomas H. Cormen,et al.
Algorithms Unlocked
,
2013
.
[3]
Olga Kurasova,et al.
Parallel Bidirectional Dijkstra's Shortest Path Algorithm
,
2010,
DB&IS.
[4]
David Johansson,et al.
An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks
,
2008
.
[5]
Raymond A. Hansen,et al.
Wide Area Networks
,
2008
.
[6]
Andrzej Kasprzak,et al.
Comparison of Heuristic Methods Applied to Optimization of Computer Networks
,
2008,
Seventh International Conference on Networking (icn 2008).