International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Design and Implementation of Mobile Map Application for Finding Shortest Direction between Two Pair Locations Using Shortest Path Algorithm: A Case Study


Affiliations
1 Department of Computer Technology, Yaba College of Technology, Yaba, Nigeria
2 Department of Computer Engineering, Yaba College of Technology, Yaba, Nigeria
 

The shortest path problem is an approach towards finding the shortest and quickest path or route from a starting point to a final destination, four major algorithms are peculiar to solving the shortest path problem. The algorithms include Dijkstra's Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm and Alternative Path Algorithm. This research work is focused on the design of mobile map application for finding the shortest route from one location to another within Yaba College of Technology and its environ. The design was focused on Dijkstra's algorithm that source node as a first permanent node, and assign it 0 cost and check all neighbor nodes from the previous permanent node and calculate the cumulative cost of each neighbor nodes and make them temporary, then chooses the node with the smallest cumulative cost, and make it as a permanent node. The different nodes that lead to a particular destination were identified, the distance and time from a source to a destination is calculated using the Google map. The application then recommends the shortest and quickest route to the destination.

Keywords

Map, Mobile Map, Dijkstra’s Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm, Alternative Path Algorithm, Shortest Path Problem.
User
Notifications
Font Size

  • ] Mojo H., (2016). Graph theory. Available at www.en.m.wikipedia.org/wiki/Graph_Theoy. Retrieved 9th August 2016.

  • ] Map of India (n.d) what is map? available at http://www.mapsofindia.com/what-is-map.html. Retrieved on December 25th, 2016.

  • ] Merriam W., (2016). Definition of Graph. Available at www.merriam-webster.com/Dictionary/graph. retrieved 13th July, 2016.

  • ] Jaehyun, P. (2015), Basic Graph Algorithms. CS 97SI. Stanford University.

  • ] Amanda B., (2016). Types of maps. Available at www.thoughtco.com/types of maps. retrieved 19th august 2016.

  • ] Al-Tameemi, H.L.H., (2014). Using Dijkstra Algorithm in Calculating AlternativeShortest Paths for Public Transportation with Transfersand Walking. Ankara.

  • ] Kairanbay, M., &Hajar, M.J., (2013). A Review and Evaluations of Shortest Path Algorithms. International Journal of Scientific and Technology Research, Vol 2, 99-101.

  • ] Holger, B., Stefan, F., Peter, S., Dominik, S., &Domagoj, M., (2010). Transit Ultrafast Shortest-Path Queries with Linear-time Preprocessing. Germany.

  • ] Avdhesh, K.S., & Sourabh, K., (2013). Finding of Shortest Path from Source to Destination by traversing every Node in wired Network International Journal of Engineering and Technology, Vol 5, 2655-2656.

  • ] Hyun J.L., & Soo D.K., (2010). A service-based approach to developing Android Mobile Internet Device (MID) applications. Service-Oriented Computing and Applications.


Abstract Views: 248

PDF Views: 1




  • Design and Implementation of Mobile Map Application for Finding Shortest Direction between Two Pair Locations Using Shortest Path Algorithm: A Case Study

Abstract Views: 248  |  PDF Views: 1

Authors

Akinwol Agnes Kikelomo
Department of Computer Technology, Yaba College of Technology, Yaba, Nigeria
Yekini Nureni Asafe
Department of Computer Engineering, Yaba College of Technology, Yaba, Nigeria
Adelokun Paul
Department of Computer Technology, Yaba College of Technology, Yaba, Nigeria
N. Lawal Olawale
Department of Computer Technology, Yaba College of Technology, Yaba, Nigeria

Abstract


The shortest path problem is an approach towards finding the shortest and quickest path or route from a starting point to a final destination, four major algorithms are peculiar to solving the shortest path problem. The algorithms include Dijkstra's Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm and Alternative Path Algorithm. This research work is focused on the design of mobile map application for finding the shortest route from one location to another within Yaba College of Technology and its environ. The design was focused on Dijkstra's algorithm that source node as a first permanent node, and assign it 0 cost and check all neighbor nodes from the previous permanent node and calculate the cumulative cost of each neighbor nodes and make them temporary, then chooses the node with the smallest cumulative cost, and make it as a permanent node. The different nodes that lead to a particular destination were identified, the distance and time from a source to a destination is calculated using the Google map. The application then recommends the shortest and quickest route to the destination.

Keywords


Map, Mobile Map, Dijkstra’s Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm, Alternative Path Algorithm, Shortest Path Problem.

References