Abstract: Evaluate the distance of the shortest route
Public transportation in Malaysia is growing rapidly due to the increase of population and the requirements of people to move swiftly from one place to another. Current railway transport web in Malaysia is getting bigger from year to year. The railways lines converged and intertwined with each other. Therefore, there might be several ways to travel from one station to another. This can cause confusion for the railway users. The objectives of this study are to analyses the shortest route of train to reach destination and to design a mobile application train map to navigate the passengers giving the shortest route to arrive the destination. Next, to develop an application which provides the choices route for passengers to get the shortest route. Besides, to evaluate the distance of the shortest route of the train to passengers arrive the destination. The method being used is Dijkstra’s algorithm. It is an algorithm that used to find the shortest path from one node to another node in a graph and it apply only on positive weights . Technologies being used in this project are Global Positioning System (GPS), Global System for Mobile Communication (GSM) and Android platform . By the end of this study, it is expected that the developed application can encourage the citizens to use the train as the transportation besides assisting them to achieve their destination .
Introduction
Malaysia is considered as a developing country. The Government implement Tranformasi Nasional 2050 (TN50) that had been planned to transform Malaysia into an advanced country. In order to achieve TN50, the field needed to be improved due time such as education, medical, business, services, transportation, and others.At the same time, Malaysia had been improving its public transport, and they are focusing on rail transportation. The rail transportation focused on big cities and the most important is in the Capital of Malaysia, Kuala Lumpur. Among rail transportation are Commuter Rail, Rapid Transit, Light Rapid Transit, and Monorail.Train map application is to navigate train passengers to get the shortest route in order to reach their destination.
Technique: Dijkstra’s algorithm
Technique to achieve the objectives.
Dijkstra’s algorithm is an algorithm that used to find the shortest path from one node to another node in a graph and it apply only on positive weights. Based on history, Dijkstra ‘s algorithm is created by computer scientist from Dutch, Edsger Dijkstra in 1956 and published in 1959. This algorithm is a graph based searching algorithm to solve the single source shortest path problem and it common used in routing.
Conclusion
By the end of this study, it is expected that the developed application can encourage the citizens to use the train as the transportation besides assisting them to achieve their destination. People over country also benefited in using this app when they are in Malaysia., hence it encourages tourism in local country. Furthermore, the apps use GPS and Dijkstra’s Algorithm which combination to give the best result the user nowadays. People also can save their budget by directly selecting their destination and the apps will automatically assist them in choosing the right path. The interface less complex which the user only need to fill their destination instead to look over the railway table. Finally, this give huge advantage to people in finding the shortest route to arrive their destination.