Journal
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
Volume 35, Issue -, Pages 286-304Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2011.09.001
Keywords
Transit assignment; Reliability-based user equilibrium; Linear Complementarity Problem; Column generation; Capacity constraint; Chance constraint
Categories
Funding
- Hui Oi Chow Trust Fund [200902172003]
- University Research Committee of the University of Hong Kong [201001159008, 201011159026]
- Arup Global Research Challenge Award
Ask authors/readers for more resources
This paper proposes a Linear Complementarity Problem (LCP) formulation for the reliability-based stochastic transit assignment problem with capacity constraints and non-additive link costs, where in-vehicle travel times and waiting times are uncertain. The capacity constraints are developed via the notions of effective capacity and chance constraints. An equivalent route-based linear program (LP) for the proposed problem is formulated to determine the patronage of each line section, critical links, critical service frequencies, unmet demand and the network capacity, which considers the risk-aversive behavior of travelers. A solution method is developed, utilizing the IC-shortest path algorithm, the column generation technique, and the revised simplex method, to solve the proposed LP with guaranteed finite convergence. Numerical experiments are also set up to illustrate the properties of the problem and the application of the proposed model for reliability analysis. (C) 2011 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available