Research on the Method of Calculating Train Congestion Index Based on the Automatic Fare Collection Data

  • Wenxuan Zhang
  • Jinjin Tang
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 482)


With the increasing operating mileage of the urban railway transit, the traffic volume of the urban railway network has risen sharply. In order to enhance the performance and safety of the urban railway transit, the research on the train congestion index is imminent. In this paper, firstly, the definition of congestion index is proposed, and the congestion degree model is formulated. Secondly, the real-time congestion degree of train lines is obtained by using the algorithm based on the spatial and temporal K-shortest path. Finally, the train congestion of Xi’an subway is analyzed and calculated by the model based on the data of passengers’ transportation cards and the process consumes just 3 min. Comparing with the actual results, we come to the conclusion that the train congestion model and space-time K-shortest path algorithm are correct and feasible, which can provide constructive suggestions on the operation and management of the urban railway network and the flow limitation of the station.


Passenger card data Train congestion index K-shortest path algorithm Urban rail transit 


  1. 1.
    Han B (2011) Discussion on development tendency of urban light rail transit under the new situation. 30(36):49–49. (in Chinese)Google Scholar
  2. 2.
    Niu X, Pan Y (2005) Research on the allocating algorithm in rail systems. The time of computer. 2:17–18. (in Chinese)Google Scholar
  3. 3.
    Zhou W (2013) Research on urban rail transit ticket clearing under the accessibility ride. (in Chinese)Google Scholar
  4. 4.
    Hoffman W, Pavley R (1959) A method for the solution of the best path problem. J ACM 6(4):506–514MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Liu J (2012) Transfer-based modeling flow assignment with empirical analysis for urban rail transit network. Beijing jiaotong University. (in Chinese)Google Scholar
  6. 6.
    Zhou Q, Li S (2013) Discussion on statistical problems of several operational indexes of Urban Rail Transit. Urban rail transit research. 16(7):1–3. (in Chinese)Google Scholar
  7. 7.
    Zhou C (2007) Metro OD information processing based on IC card data. Modern urban rail transit. 47–49. (in Chinese)Google Scholar
  8. 8.
    Jia N(2008) Research on the problems of city rail traffic ticket income distribution. Beijing jiaotong University. (in Chinese)Google Scholar
  9. 9.
    Qin Z (2011) Study on passenger route choice of Urban Rail Transit under network condition. Beijing jiaotong University. (in Chinese)Google Scholar
  10. 10.
    Liu X (2013) Study on subway dynamic assignment model based on Timetable. Chang’an University. (in Chinese)Google Scholar
  11. 11.
    Lai S (2008) Study on the method of city rail traffic ticket income distribution. Beijing jiaotong University. (in Chinese)Google Scholar
  12. 12.
    Li W (2004) Research on delay constrained minimum cost multicast routing algorithm. Chinese Science and Technology University. (in Chinese)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.School of Traffic and TransportationBeijing Jiaotong UniversityBeijingChina

Personalised recommendations