Date of Award

1-1-2017

Document Type

Thesis

Degree Name

M.S.

Department

Computer Science

First Advisor

Nathan Sturtevant, Ph.D.

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*.

Copyright Statement / License for Reuse

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Provenance

Received from ProQuest

Rights holder

Sneha Sawlani

File size

58 p.

File format

application/pdf

Language

en

Discipline

Computer Science

Share

COinS