Public Transport Planning System by Dijkstra Algorithm: Case Study Bangkok Metropolitan Area

Authors: Pimploi Tirastittam, Phutthiwat Waiyawuththanapoom

Abstract:

Nowadays the promotion of the public transportation system in the Bangkok Metropolitan Area is increased such as the “Free Bus for Thai Citizen” Campaign and the prospect of the several MRT       routes to increase the convenient and comfortable to the Bangkok Metropolitan area citizens. But citizens do not make full use of them it because the citizens are lack of the data and information and also the confident to the public transportation system of Thailand especially in the time and safety aspects. This research is the Public Transport Planning System by Dijkstra Algorithm: Case Study Bangkok Metropolitan Area by focusing on buses, BTS and MRT schedules/routes to give the most information to passengers. They can choose the way and the routes easily by using Dijkstra STAR Algorithm of Graph Theory which also shows the fare of the trip. This Application was evaluated by 30 normal users to find the mean and standard deviation of the developed system. Results of the evaluation showed that system is at a good level of satisfaction (4.20 and 0.40). From these results we can conclude that the system can be used properly and effectively according to the objective.

Keywords: Dijkstra Algorithm, Graph Theory, Shortest Route, Public Transport, Bangkok Metropolitan Area.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1336370

References:

[1] Bangkok Mass Transit Authority (2011), Bangkok Mass Transit Authority, 28 August 2011 from Bangkok Mass Transit Authority: http://www.bmta.co.th/th/about_history.php/.
[2] Bangkok Mass Transit System Public Company Limited (2011), Bangkok Mass Transit System Public Company Limited, 19 August 2011 from Bangkok Mass Transit System Public Company Limited: http://www.bts.co.th/customer/th/main.aspx/.
[3] Bangkok Metro Public Company Limited (2005), Bangkok Metro Public Company Limited, 25 August 2011 from Bangkok Metro Public Company Limited: http://www.bangkokmetro.co.th/.
[4] Biggs N., Lloyd E., and Wilson R., (1986), "Graph Theory”, Oxford University Press, P.1736-1936.
[5] Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). "Section 24.3: Dijkstra's algorithm". Introduction to Algorithms (Second ed.). MIT Press and McGraw-Hill. P.595–601. ISBN 0-262-03293-7.
[6] Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs". Numerische Mathematik Vol.1 P. 269–271.
[7] Lursinsap C., Analysis and Design of Algorithms, Bangkok, School and University Media Publishing, 2000.
[8] Zhan F.B. and Noon C.E. (February 1998). "Shortest Path Algorithms: An Evaluation Using Real Road Networks". Transportation Science Vol.32 (1): P.65–73.
[9] Eklund P.W., Kirkby S., Pollitt S., (1996) "A Dynamic Multi-source Dijkstra’s Algorithm for Vehicle Routing”, Intelligent Information Systems P.329-333.
[10] Schulz F., Wagner D., Weihe K., (2000), "Dijkstra's algorithm on-line: an empirical case study from public railroad transport", Journal of Exponential Algorithmics Vol.5.
[11] Epp S.E., Discrete Mathematics with Applications 3rd Edition, Belmont CA, Thompson Publishing, 2004.