Shortest Path Algorithm for Transportation Networks, Case Study: Kumasi Metropolitan Assembly

Author(s)

Jonathan Annan , N.F Darquah , K. Baah Gyamfi ,

Download Full PDF Pages: 66-73 | Views: 859 | Downloads: 186 | DOI: 10.5281/zenodo.3411878

Volume 2 - August 2013 (08)

Abstract

In a metropolis such as Kumasi, the transport network is massive, dynamic, and complicated. Route finding is not an easy task, especially when routes comprise several modes. This problem is even more important for e-tourism tourists, security services and moving workforces, who may need to visit unfamiliar parts of the metropolis. In this research paper, we present shortest path algorithm for transportation networks, of the Kumasi Metropolitan Assembly (KMA). User friendly extension of ArcGIS and Visual Basic Dot Net with Dijkstra’s algorithm was used to provide the shortest path from one node to the other.

Keywords

ArcGIS Network Analyst, Shortest path, Dijkstra’s algorithm and VB. Net

 

References

        i.        Ahuja, R. K., Magnanti, T. L., Orlin, J. B., (1993). Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, N. J.

ii.      Bellman, R., (1958). On a Routing Problem, Quart. Appl. Math. 16, 87-90.

iii.    Cherkassky, B. V., Goldberg, A. V., Radzik, T., (1996), Shortest path algorithms: Theory and experimental evaluation, Mathematical Programming 73, 129-174.

iv.    Husdal, J. (2000). Fastest Path Problems in Dynamic Transportation Networks, http://www.husdal.com/mscgis/research.htm, last accessed November 22, 2005.

v.      Vonderohe, A. P., Travis, L., Smith, R. L. and Tasai, V. (1993). NCHRP Report 359, Adoption of Geographic Information System for Transportation, Transport Research Board, National Research Council, Washington, DC.

vi.    Skiena, S. (1990). Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pages. 135-136.

vii.  Dijkstra, E. W. (1959). A note on two problems in connexion with graphs Numerische Mathematik 1, pages. 269-271.

viii.Hart, P. E., Nilsson, N. J., Raphael, B. (1972). Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths", SIGART Newsletter, 37, pages. 28-29.

ix.    Young-Hwan Lee (1994). A Study on the Development Plan of the New Yong-Jong Island International Airport.

Cite this Article: