Multimedia application to an extended public transportation network in South Korea: optimal path search in a multimodal transit network

Various traffic network usage formats have arisen along with the popularization of automobiles and the continued service extension of busses, subways, and other forms of public transportation. Due to various characteristics of public transportation networks, unlike general street networks, many issues can affect public transportation, and an optimal course search should be considered. Present research considers plans to improve the overall efficiency of public transportation systems with regard to destination, means, route, and other factors to be selected efficiently in this environment as public transportation usage increases. From this perspective, it suggests the characteristics that a multimodal transit network route search algorithm should have and a corrective algorithm that implements this in an applicable program. Implementation was done in Google android application which provides a simple user interface to find optimal routes in Google Map. The proposed application would enable overall quality-of-service improvement and balanced usage of public transportation, efficient traffic management, and other advantages.

[1]  E. Martins.  On a multicriteria shortest path problem , 1984 .

[2]  H. W. Corley,et al.  Shortest paths in networks with vector weights , 1985 .

[3]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[4]  Ravindra K. Ahuja,et al.  Some Recent Advances in Network Flows , 1991, SIAM Rev..

[5]  Rui Yang,et al.  A New Algorithm for Network Diameter , 2008, 2008 The 9th International Conference for Young Computer Scientists.

[6]  Kim Allan Andersen,et al.  A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..

[7]  Giovanni Storchi,et al.  Shortest viable path algorithm in multimodal networks , 2001 .

[8]  Dongjoo Park,et al.  A Link-Based Label Correcting Multi-Objective Shortest Paths Algorithm in Multi-Modal Transit Networks , 2008 .

[9]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[10]  D. Shier,et al.  An empirical investigation of some bicriterion shortest path algorithms , 1989 .

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  Andrew V. Goldberg,et al.  Buckets, heaps, lists, and monotone priority queues , 1997, SODA '97.

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Lee Mee-Young,et al.  Finding Alternative Routes in Inter Modal Transit Networks Considering Constraints , 2005 .

[15]  Je Jin Park,et al.  Development of User Customized Path Finding Algorithm for Public Transportation Information , 2008 .

[16]  Young-Ihn Lee,et al.  A Methodology of Multimodal Public Transportation Network Building and Path Searching Using Transportation Card Data , 2008 .