A new bidirectional algorithm for shortest paths
AbstractFor finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm.An A* instance requires a heuristic estimate, a real-valued function on the set of nodes.The version of bidirectional~A* that is considered the most appropriate in literature hitherto,uses so-called balanced heuristic estimates.This means that the two estimates of the two directions are in balance, i.e., their sum is a constant value.In this paper, we do not restrict ourselves any longer to balanced heuristics.A generalized version of bidirectional A* is proposed, where the heuristic estimate does not need to be balanced.This new version turns out to be faster than the one with the balanced heuristic.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 2008-25.
Date of creation: 24 Nov 2008
Date of revision:
Contact details of provider:
Web page: http://www.few.eur.nl/few
shortest path; bidirectional search; road network search;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-03-28 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If references are entirely missing, you can add them using this form.