2026-06-15T08:48:48Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/4865 2021-12-13T02:34:34Z 1582963302567:1597824273898 user-ucsy

Removing Unnecessary Map-based Data for Search Space Reduction Hlaing, Win Mar Sein, Myint Myint Smartphones and ubiquitous devices are moreand more popular and used for map based services innowadays. Map based Services are especially usedfor transportation systems. In this system, optimalpath will be recommended for the person who willride the bus from its location to nearest bus stop andsuggest the shortest path to the destination bus stopfor the mobile application. The system will suggestnot only the nearest bus stop but also the optimal busroute including the transit between them in YangonRegion. Many searching techniques are used forfinding the shortest paths but fast searching problemsare not enough. So, Adjacency matrices and K-meansclustering Algorithm are used for removingunnecessary clusters or map based data to bereduced the search space and to be fast in search. A*algorithm with bidirectional is used to find theshortest path that know the target destination.Dijkstra algorithm with bidirectional search is alsoused to find the shortest path that intends the blindsearch. 2017-02-16 http://hdl.handle.net/20.500.12678/0000004865 https://meral.edu.mm/records/4865