DJIKSTRA Algorithm Based Approach to Shortest Path Model in Public Bus Transportation

Abstract

In these days, as the android is getting more popular, lots of Android applications that are used for the public interest and attracts much more attention. Mobile applications are a rapidly growing segment of the global mobile market and the mobile application is made to solve problems in everyday life. This study is designed to help the users of public transport, in the search for the bus stop and the route to be taken to get the bus stop. Google Maps is one of the applications, which can help users in solving problems that in the search location. However, the data existing locations on Google Maps for public bus stop, such as kopaja and metromini are still not available and also, the shortest route is not provided. Based on these problems, it is necessary to search Android apps bus service, solely devoted to the type of public bus transportation is bus types kopaja and metromini. Results from this study are an application, that can help users find the shortest route and give recommendations on the bus type (Kopaja or Metromini). The mobile application developed in this research, which can make all users can be easier to find the bus stop and get the shortest route to the bus stop. A solution heuristic, based on a DJIKSTRA algorithm is also suggested. Its performance is evaluated through an example problem.