Abstract:
This paper aims to support the most suitable
route for passengers of the taxi system using the proposed
heuristic search method. Furthermore, k-Means Nearest Point
Search (kMNPS) algorithm is proposed to produce the nearest
road point for start and end addresses. Yangon downtown in
Myanmar is selected as a case study for the transportation
system. The proposed heuristic method and kMNPS algorithm
reduce the distance calculations and achieve the very low time
complexity for the real time transportation applications.
Moreover, the proposed system can produce not only the
optimal route on the map but also the popular spots near the
optimal route.
