Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks

<p>The heuristic search community traditionally uses A* as the baseline algorithm for their research methods. Research papers in the road networks community, however, often build upon Dijkstra's algorithm and use Bidirectional Dijkstra's algorithm as their baseline. This thesis investigates the performance of A* and Bidirectional Dijkstra in road networks to see how they compare and to see if there is a principled explanation for the different approaches. Our analysis reveals why Bidirectional Dijkstra can perform well in this domain, but also shows a simple mistake that can be made when building test problems that hurts the performance of A*.</p>

Name thesis:degree_name

M.S.

Level thesis:degree_level

Masters Thesis

Year dc:date.available

2017

Author dc:creator

• Sawlani, Sneha

Contributors dc:contributor

• Nathan Sturtevant, Ph.D.
• Chris Gauthier-Dickey
• Mei Yin

• A*
• Bidirectional dijkstra
• Dijkstra's algorithm
• Road networks
• Search algorithms
• Computer Engineering

Statement dc:rights

• <p>Copyright is held by the author. User is responsible for all copyright compliance.</p>

Language dc:language

en

Repository record dc:identifier

https://digitalcommons.du.edu/etd/1303

OAI identifier oai:identifier

oai:digitalcommons.du.edu:etd-2303