Abstract:
Smartphones and ubiquitous devices are more
and more popular and used for map based services in
nowadays. Map based Services are especially used
for transportation systems. In this system, optimal
path will be recommended for the person who will
ride the bus from its location to nearest bus stop and
suggest the shortest path to the destination bus stop
for the mobile application. The system will suggest
not only the nearest bus stop but also the optimal bus
route including the transit between them in Yangon
Region. Many searching techniques are used for
finding the shortest paths but fast searching problems
are not enough. So, Adjacency matrices and K-means
clustering Algorithm are used for removing
unnecessary clusters or map based data to be
reduced the search space and to be fast in search. A*
algorithm with bidirectional is used to find the
shortest path that know the target destination.
Dijkstra algorithm with bidirectional search is also
used to find the shortest path that intends the blind
search.
