File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Reliability-based stochastic transit assignment with capacity constraints: Formulation and solution method
Title | Reliability-based stochastic transit assignment with capacity constraints: Formulation and solution method |
---|---|
Authors | |
Issue Date | 2016 |
Citation | UrbanITS Seminar, Tandon School of Engineering, New York University, New York, USA, 21 June 2016 How to Cite? |
Abstract | This study 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 K-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. |
Persistent Identifier | http://hdl.handle.net/10722/270926 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Szeto, WY | - |
dc.date.accessioned | 2019-06-14T03:09:03Z | - |
dc.date.available | 2019-06-14T03:09:03Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | UrbanITS Seminar, Tandon School of Engineering, New York University, New York, USA, 21 June 2016 | - |
dc.identifier.uri | http://hdl.handle.net/10722/270926 | - |
dc.description.abstract | This study 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 K-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. | - |
dc.language | eng | - |
dc.relation.ispartof | NYU, Tandon School of Engineering, UrbanITS Seminar | - |
dc.title | Reliability-based stochastic transit assignment with capacity constraints: Formulation and solution method | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Szeto, WY: ceszeto@hku.hk | - |
dc.identifier.authority | Szeto, WY=rp01377 | - |
dc.identifier.hkuros | 263045 | - |