DocumentCode
1584628
Title
An algorithm for transit assignment with elastic demand under capacity constrain
Author
Quan-Sheng, Lei ; Jian, Chen
Author_Institution
Sch. of Econ. & Manage., Tsinghua Univ., Beijing, China
Volume
6
fYear
2004
Firstpage
5245
Abstract
This paper studies the capacity restraint transit assignment problem with elastic demand. We analyze the urban transit network characteristics, such as the links have finite capacities, equilibrium delay only arises when capacity is reached; and then a variational inequality model of the stochastic user equilibrium transit assignment with elastic demand under capacity constrain is proposed. The proposed model can simultaneously predict how passengers would choose their optimal routes and estimate passenger flows in a congested transit networks. Based on the penalty function method, an algorithm for solving the proposed model is presented. Finally, the algorithm is illustrated with a numerical example. The results show that the algorithm is quite satisfactory.
Keywords
rapid transit systems; road traffic; capacity constrain; elastic demand; optimal routes; passenger flow estimation; transit assignment; urban transit network; Cost function; Economic forecasting; Frequency; Linear programming; Mathematical model; Predictive models; Stochastic processes; Telecommunication traffic; Traffic control; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on
Print_ISBN
0-7803-8273-0
Type
conf
DOI
10.1109/WCICA.2004.1343722
Filename
1343722
Link To Document