Date of Award
1-1-2017
Document Type
Masters Thesis
Degree Name
M.S.
Organizational Unit
Daniel Felix Ritchie School of Engineering and Computer Science, Computer Science
First Advisor
Nathan Sturtevant, Ph.D.
Second Advisor
Chris Gauthier-Dickey
Third Advisor
Mei Yin
Keywords
A*, Bidirectional dijkstra, Dijkstra's algorithm, Road networks, Search algorithms
Abstract
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*.
Publication Statement
Copyright is held by the author. User is responsible for all copyright compliance.
Rights Holder
Sneha Sawlani
Provenance
Received from ProQuest
File Format
application/pdf
Language
en
File Size
58 p.
Recommended Citation
Sawlani, Sneha, "Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks" (2017). Electronic Theses and Dissertations. 1303.
https://digitalcommons.du.edu/etd/1303
Copyright date
2017
Discipline
Computer Science