Skip to main content
SpringerLink
Log in

Equilibrium model and algorithm of urban transit assignment based on augmented network

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

The passenger flow assignment problem for the urban transit network is relatively complicated due to the complexity of the network structure and many factors influencing the passengers’ route and line choices. In the past three decades, many models have been proposed to solve the passenger flow assignment problem. However, the common-line problem remains challenging in transit flow assignment. In this paper, the characteristics of the urban transit network is analysed and a new technique of augmented network is proposed to represent the urban transit system. The purpose is to eliminate the complex common-line problem when modeling transit passenger flow assignment. Through this augmentation technique, the urban transit system can be represented by an augmented network-it then behaves like a simple network and can be used as a generalized network for traffic assignment or network analysis. This paper presents a user equilibrium model for the urban transit assignment problem based on such a technique. A numerical example is also provided to illustrate the approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dafermos S C. Relaxation algorithm for the general asymmetric traffic equilibrium problem. Transportation Sci, 1982, 16: 231–240

    Article  MathSciNet  Google Scholar 

  2. Smith M J. An algorithm for solving asymmetric equilibrium problem with a continuous cost-flow function. Transport Res, 1983, 18B: 432–448

    Google Scholar 

  3. Sheffi Y. Urban transportation networks: Equilibrium analysis with mathematical programming methods. New Jersey: Prentice-Hall, Englewood Cliffs, 1985

    Google Scholar 

  4. Huang H J. A study on Logit assignment which excludes all cyclic flows. Transportation Res, 1998, 32B: 401–412

    Article  Google Scholar 

  5. Yang H, Huang H J. The multi-class, multi-criteria traffic network equilibrium and system optimum problem. Transport Res, 2004, 38B: 1–15

    Article  Google Scholar 

  6. Dial R B. Transit pathfinder algorithms. Highway Research Record, 1967, 205: 67–85

    Google Scholar 

  7. Fearnside K, Draper D P. Public transport assignment—A new approach. Traffic Eng Control, 1971, 298–299

  8. Le Clercq F. A public transport assignment model. Traffic Eng Control, 1972, 91–96

  9. De Cea J, Fernández E. Transit assignment for congested public transport systems: An equilibrium model. Transport Sci, 1993, 27(2): 133–147

    Article  MATH  Google Scholar 

  10. Wu J H, Florian M, Marcotte P. Transit equilibrium assignment: A model and solution algorithms. Transport Sci, 1994, 28(3): 193–203

    Article  MATH  Google Scholar 

  11. Lam W H K, Gao Z Y, Chan K S, et al. A stochastic user equilibrium assignment model for congested transit networks. Transport Res, 1999, 33B: 351–368

    Article  Google Scholar 

  12. Cominetti R, Correa J. Common-lines and passenger assignment in congested transit networks. Transport Sci, 2001, 35(3): 250–267

    Article  MATH  Google Scholar 

  13. Cepeda M, Cominetti R, Florian M. A frequency-based assignment model for congested transit networks with strict capacity constraints: Characterization and computation of equilibria. Transport Res, 2006, 40B: 437–459

    Article  Google Scholar 

  14. Chriqui C, Robillard P. Common bus lines. Transport Sci, 1975, 9: 115–121

    Article  Google Scholar 

  15. Spiess H, Florian M. Optimal strategies: A new assignment model for transit network. Transport Res, 1989, 23B: 83–102

    Article  Google Scholar 

  16. Nguyen S, Pallottino S. Hyperpaths and shortest hyperpaths, combinatiorial optimization. In: Lecture Note in Mathematics. Berlin: Springer-Verlag, 1989. 258–271

    Google Scholar 

  17. Kurauchi F, Bell M G H, Schmöcker J D. Capacity constrained transit assignment with common lines. J Math Model Algorithm, 2003, 2(4): 309–327

    Article  MATH  Google Scholar 

  18. Si B F, Long J C, Gao Z Y. Optimization model and algorithm for mixed traffic of urban road network with flow interference. Sci China Ser E-Tech Sci, 2008, 51(12): 2223–2232

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of System Science, School of Traffic and Transportation, Beijing Jiaotong University, Beijing, 100044, China

    BingFeng Si, HuiJun Sun & ZiYou Gao

  2. Department of Civil Engineering, University of New Brunswick, Fredericton, N.B., E3B 5A3, Canada

    Ming Zhong

Authors
  1. BingFeng Si
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. HuiJun Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. ZiYou Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to BingFeng Si.

Additional information

Supported by the National Natural Science Foundation of China (Grant No. 70631001), the National Basic Research Program of China (“973” Project) (Grant No. 2006CB705500) and the Natural Science and Engineering Research Council (NSERC), Canada (Grant No. 342485-07)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Si, B., Zhong, M., Sun, H. et al. Equilibrium model and algorithm of urban transit assignment based on augmented network. Sci. China Ser. E-Technol. Sci. 52, 3158–3167 (2009). https://doi.org/10.1007/s11431-009-0260-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11431-009-0260-8

Keywords

Search

Navigation