Abstract
: For urban rail transit, an environmentally-friendly transportation mode, reasonable passenger flow assignment is the basis of train planning and passenger control, which is conducive to the sustainability of finance, operation and production. With the continuous expansion of the scale of urban rail networks, passenger travel path decision-making tends to be complex, which puts forward higher requirements of networked transportation organization. Based on undirected graphs and the idea of the recursive divide-and-conquer algorithm, this paper proposes a hierarchical effective path search method made up of a three-layer path generation strategy, which consists of deep search line paths, key station paths composed of origin–destination (O-D) nodes and transfer stations, and the station sequence path between the key stations. It can effectively simplify the path search and eliminate obvious unreasonable paths. Comparing the existing research results based on the classical polynomial Logit model, a practical Improved C-Logit multi-path passenger flow assignment model is proposed to calculate the selection ratio of each path in the set of effective paths. Combining the hierarchical path search strategy, the O-D pairs of passenger flow are divided into local-line and cross-line situations. The time-varying cross-line passenger flow is decomposed into a series of passenger sections along the key station paths. A passenger flow pushing assignment algorithm based on line decomposition is designed, which satisfies the dynamic, time-varying and continuous characteristics. The validation of Guangzhou Metro’s actual line network and time-varying O-D passenger demand in 2019 shows that the spatio-temporal distribution results of the passenger pushing assignment have a high degree of coincidence with the actual statistical data.
Highlights
As the backbone of the public transport system, urban rail transit has the characteristics of energy-saving, land-saving, large capacity, non-pollution and safety, which are suitable for the sustainable development of large and medium-sized cities [1,2,3,4]
It is difficult to accurately determine the transfer path and ride information of passenger flow with the same origin and destination (O-D) pair in the urban rail system, which brings challenges to the assignment of urban rail passenger flow on a network scale and in a systemic way. In this context, aiming at the characteristics of urban rail network operation, based on undirected graphs and the recursive divide-and-conquer idea, this paper proposes a Hierarchical Effective Path Search Strategy which generates the effective path set by dividing the network into three layers: line layer, key station layer and station sequence layer between key stations
Based on the traditional graph traversal method, combined with the transfer characteristics of the urban rail network, the passenger path formation process is divided into three layers: line path, key station path composed of the O-D pair and transfer stations, and complete path composed of station sequence
Summary
As the backbone of the public transport system, urban rail transit has the characteristics of energy-saving, land-saving, large capacity, non-pollution and safety, which are suitable for the sustainable development of large and medium-sized cities [1,2,3,4]. It is difficult to accurately determine the transfer path and ride information of passenger flow with the same O-D pair in the urban rail system, which brings challenges to the assignment of urban rail passenger flow on a network scale and in a systemic way In this context, aiming at the characteristics of urban rail network operation, based on undirected graphs and the recursive divide-and-conquer idea, this paper proposes a Hierarchical Effective Path Search Strategy which generates the effective path set by dividing the network into three layers: line layer, key station layer and station sequence layer between key stations. The model and algorithm are verified by the Guangzhou Metro instance
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
