Abstract
The shortest path query problem in large scale time-varying transit network is NPhard.Approximate search algorithm is not satisfactory,and the exact search algorithm is inefficient.In this paper,a time-varying mathematical model for transit network is formulated according to the time-varying and uncertainty characteristic of public transport network.The choice of the optimal path for transit network is decomposed into transfer times and transfer line query problem.A query algorithm for transfer times is proposed based on the line mapping network and an algorithm for both transfer site and travel distance is proposed based on site mapping network.Both of them are polynomial.Finally we use a numerical example to illustrate the solution process of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Complex Systems and Complexity Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
