By Topic

An algorithm for transit assignment with elastic demand under capacity constrain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lei Quan-Sheng ; Sch. of Econ. & Manage., Tsinghua Univ., Beijing, China ; Chen Jian

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.

Published in:

Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on  (Volume:6 )

Date of Conference:

15-19 June 2004