This article describes an original shortest path algorithm for graphs representing a real road network. We test the influence of a coefficient weighing the evaluated distance used in such short path algorithms. This coefficient has an influence on the performance of the shortest path algorithm which uses the evaluated distance as heuristic. We try to provide a better algorithm using this heuristic and we test its evaluation in various situations. The results presented in this paper are used to write new shortest path algorithms for large real road networks. To conclude, we experiment this algorithm and some alternatives in various situations.
Improvement of a Shortest Routes Algorithm
2007-09-01
817248 byte
Conference paper
Electronic Resource
English
Shortest Routes between Sets on Gray-Level Surfaces
British Library Online Contents | 2005
|Energy-efficient shortest routes for electric and hybrid vehicles
Online Contents | 2017
|High Performance Computation of Shortest Routes for Intelligent Transportation Systems Applications
British Library Conference Proceedings | 1995
|Shortest routes on varying height surfaces using gray-level distance transforms
British Library Online Contents | 2005
|Parallel and Distributed Computation of Shortest Routes and Network Equilibrium Models
British Library Conference Proceedings | 1997
|