Finding Shortest Path and Transit Nodes in Public Transportation System

摘要

One of the most important pieces of information to be delivered to public transportation users is the quickest bus routes between user specified current and destination. In this system, A* algorithm is used to find the shortest path and bus route information in Yangon downtown area. Not only direct information but also transit information can give between current and destination bus stop. Bus routes, bus information, bus stops and their related position, latitude/longitude and road names are stored in spatial database. When the users want to know the bus route information, firstly they give their current location and desired destination to the system and then the related bus routes are retrieved from database. After getting the bus routes, A* algorithm is used to calculate the shortest path. By using the TRANSIT algorithm, transit route and information will be displayed on the map. Vector map of Yangon region is used to create as base map in this paper.