Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pun-Cheng, L.S.C.: An interactive web based public transport enquiry system with real time optimal route computation. IEEE Transactions on Intelligent Transportation Systems 13(2) (June 2012)
Transactions on Intelligent Transportation Systems 13(2) (June 2012)
Pucher, J., Korattyswaroopam, N.: Rutgers University Neenu Ittyerah. The Crisis of Public Transport in India: Overwhelming Needs but Limited Resources 7(3) (2004)
Samet, H.: University of Maryland,USA. Database and Geographical Information System (GIS) (2002)
Liu, C.-L., Pai, T.-W., Chang, C.-T., Hsieh, C.-M.: Path-Planning Algorithms for Public Transportation Systems. In: The 4th International IEEE Conference on Intelligent Transportation System, USA (August 2001)
Dai, L.: Fast Shortest Path Algorithm for Road Network and Implementation. Carleton University if Computer
Science COMP 4905 HONOURS PROJECT Fall Term (2005); Subadra, N., Bhagavan Das, M., Rama Seshagiri Rao, C.: Directed Graph Algorithms for Tours–A Case Study. Scholarlink Research Institute Journals (2011) (ISSN: 2141–7016)
Abhishek, G., Prateek, M., Rishabh, L., Ms, N.S.: Path Finding: A* or DIJKSTRA’S? IJITE 2(1) (January 2013)
Goldberg, A.V., Harrelson, C.: Computing the Shortest Path:A_ Search Meets Graph Theory, Technical Report MSR-TR-2004–24
Sebastian, K., Peter, S., Dominik, S., Frank, S.: Fast Computation of Distance Tables using Highway Hierarchies (July 25, 2006)
Bast, H., Funke, S., Matijievic, D.: Transit ultrafast shortest-path queries with linear-time preprocessing. In: 9th DIMACS Implementation Challenge (2006)
Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest path queires in road networks. In: Proc. 9th Workshop on Algorithm Engineering and Experimentation (ALENEX) (2007)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Zar, M.T., Sein, M.M. (2016). Finding Shortest Path and Transit Nodes in Public Transportation System. In: Zin, T., Lin, JW., Pan, JS., Tin, P., Yokota, M. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 387. Springer, Cham. https://doi.org/10.1007/978-3-319-23204-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-23204-1_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23203-4
Online ISBN: 978-3-319-23204-1
eBook Packages: EngineeringEngineering (R0)