Study And Practice Of An Optimum Path Search Algorithm Preceding Public Transportation Network With Rail Transit In City

In modern city, it's normal to have a convenient public transportation network. Citizens have to face a problem which is how to get the target station, when a city has a big public transportation network such as Shanghai, Beijing.In order to solve this problem, this paper has built a model for public transportation network, and get RTN's shortest path by Floyd algorithm, then this paper get Kth short path base on deviation path, then get BTN's shortest path by aggregate for intersection, at the end I have combined this two part into the Kth for PTN. At last I had designed and implemented a software base on the method which gives in this paper. This software can provide the shortest path query for citizen.The main study of this paper is:1) Build a model for shanghai's public transportation network, study how to build this model in effective and convenient. And find a method to store the data of stations and lines to Mysql database. Study and practice of bus and rail into joint modeling method for the first time.2) Provide an algorithm to find the shortest path in bubs transportation network, and implementation this algorithm.3) Base on the model of RTN defines in this paper and the algorithm of Floyd, I study and implementation this algorithm, at last gets the second shortest path and third shortest path.4) Base on MVC framework and use Struts, Hibernate and Mysql with Java programmer language implementation this software, and give the solution for the Internet.5) At last, in order to ensure this software can provide a stable servicel had use Junit to test this software.