Modified stochastic user-equilibrium assignment algorithm for urban rail transit under network operation

Abstract

Based on the framework of method of successive averages (MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail transit (URT) under network operation. In order to describe the congestion’s impact to passengers’ route choices, a generalized cost function with in-vehicle congestion was set up. Building on the k-th shortest path algorithm, a method for generating choice set with time constraint was embedded, considering the characteristics of network operation. A simple but efficient route choice model, which was derived from travel surveys for URT passengers in China, was introduced to perform the stochastic network loading at each iteration in the algorithm. Initial tests on the URT network in Shanghai City show that the methodology, with rational calculation time, promises to compute more precisely the passenger flow distribution of URT under network operation, compared with those practical algorithms used in today’s China.

Keywords

urban rail transit / stochastic user equilibrium / assignment algorithm / method of successive averages / network operation

References

[1] Ben-AkivaM, LermanS RDiscrete choice analysis: Theory and application to travel demand [M], 1985Cambridge, MassachusettsMIT Press31-57

[2] SmithT E, HsuC C, HsuY L. Stochastic user equilibrium model with implicit travel time budget constraint [J]. Transportation Research Record: Journal of the Transportation Research Board, 2008, 2085: 95-103

[3] LiuY L, BunkerJ, FerreiraL. Transit users’ route-choice modeling in transit assignment: A review [J]. Transport Reviews, 2010, 30(6): 753-769

[4] LiuT-liangA study on game equilibria and economic behaviors in transportation network with information provision [D], 2008BeijingSchool of Economics and Management, Beijing Jiaotong University14-27

[5] ZhuWeiResearch on the model and algorithm of mass passenger flow distribution in network for urban rail transit [D], 2011ShanghaiSchool of Transportation Engineering, Tongji University15-24

[6] KatoH, KanekoY, InoueM. Comparative analysis of transit assignment: Evidence from urban railway system in the Tokyo Metropolitan Area [J]. Transportation, 2010, 37(7): 775-799

[7] ShelffiYUrban transportation networks: equilibrium analysis with mathematical programming methods [M], 1985Englewood CliffsPrentice-Hall, Inc312-341

[8] ThomasRTraffic assignment techniques [M], 1991AldershotThe Academic Publishing Group32-46

[9] BellM G H, IidaYTransportation network analysis [M], 1997Chichester, West SussexJohn Wiley & Sons101-120

[10] CascettaETransportation systems analysis: models and applications [M], 2009New York, NYSpringer Science & Business Media43-51

[11] BekhorS, ToledoT. Investigating path-based solution algorithm to the stochastic user equilibrium problem [J]. Transportation Research Part B, 2005, 39(4): 279-295

[12] ZhangT R, YangC, ChenD D. Modified origin-based algorithm for traffic equilibrium assignment problems [J]. Journal of Central South University, 2011, 18(5): 1765-1772

[13] SheffiY, PowellW B. An algorithm for the equilibrium assignment problem with random link times [J]. Networks, 1982, 12(2): 191-207

[14] LamW H K, GaoZ Y, ChanK S, YangH. A stochastic user equilibrium assignment model for congested transit networks [J]. Transportation Research Part B, 1999, 33(6): 351-368

[15] FlyvbjergB, HolmM K S, BuhlS L. Inaccuracy in traffic forecasts [J]. Transport Reviews, 2007, 26(1): 1-24

[16] NielsenO A. A stochastic transit assignment model considering differences in passengers utility functions [J]. Transportation Research Part B, 2000, 34(5): 337-402

[17] BekhorS, Ben-AkivaM, RammingS. Evaluation of choice set generation algorithm for route choice models [J]. Annals of Operation Research, 2006, 144(1): 235-247

[18] XuR-h, LuoQ, GaoPengResearch on the clearing method of beijing ACC on urban mass transit [R], 2007ShanghaiTongji University