Home > Research > Publications & Outputs > Reliability-based stochastic transit assignment...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Reliability-based stochastic transit assignment with capacity constraints: formulation and solution method

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Reliability-based stochastic transit assignment with capacity constraints: formulation and solution method. / Szeto, W. Y.; Jiang, Yu; Wong, K. I. et al.
In: Transportation Research Part C: Emerging Technologies, Vol. 35, 10.2013, p. 286-304.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Szeto, WY, Jiang, Y, Wong, KI & Solayappan, M 2013, 'Reliability-based stochastic transit assignment with capacity constraints: formulation and solution method', Transportation Research Part C: Emerging Technologies, vol. 35, pp. 286-304. https://doi.org/10.1016/j.trc.2011.09.001

APA

Szeto, W. Y., Jiang, Y., Wong, K. I., & Solayappan, M. (2013). Reliability-based stochastic transit assignment with capacity constraints: formulation and solution method. Transportation Research Part C: Emerging Technologies, 35, 286-304. https://doi.org/10.1016/j.trc.2011.09.001

Vancouver

Szeto WY, Jiang Y, Wong KI, Solayappan M. Reliability-based stochastic transit assignment with capacity constraints: formulation and solution method. Transportation Research Part C: Emerging Technologies. 2013 Oct;35:286-304. Epub 2011 Oct 19. doi: 10.1016/j.trc.2011.09.001

Author

Szeto, W. Y. ; Jiang, Yu ; Wong, K. I. et al. / Reliability-based stochastic transit assignment with capacity constraints : formulation and solution method. In: Transportation Research Part C: Emerging Technologies. 2013 ; Vol. 35. pp. 286-304.

Bibtex

@article{fc1ed2f5cc7a463f9443e186dea584b3,
title = "Reliability-based stochastic transit assignment with capacity constraints: formulation and solution method",
abstract = "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.",
keywords = "Transit assignment, Reliability-based user equilibrium, Linear Complementarity Problem, Column generation, Capacity constraint, Chance constraint, TRAFFIC ASSIGNMENT, TRANSPORTATION NETWORKS, EQUILIBRIUM ASSIGNMENT, PASSENGER ASSIGNMENT, RESERVE CAPACITY, MARKET REGIMES, ROAD NETWORK, MODEL, FREQUENCY, UNCERTAINTY",
author = "Szeto, {W. Y.} and Yu Jiang and Wong, {K. I.} and Muthu Solayappan",
year = "2013",
month = oct,
doi = "10.1016/j.trc.2011.09.001",
language = "English",
volume = "35",
pages = "286--304",
journal = "Transportation Research Part C: Emerging Technologies",
issn = "0968-090X",
publisher = "PERGAMON-ELSEVIER SCIENCE LTD",

}

RIS

TY - JOUR

T1 - Reliability-based stochastic transit assignment with capacity constraints

T2 - formulation and solution method

AU - Szeto, W. Y.

AU - Jiang, Yu

AU - Wong, K. I.

AU - Solayappan, Muthu

PY - 2013/10

Y1 - 2013/10

N2 - 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.

AB - 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.

KW - Transit assignment

KW - Reliability-based user equilibrium

KW - Linear Complementarity Problem

KW - Column generation

KW - Capacity constraint

KW - Chance constraint

KW - TRAFFIC ASSIGNMENT

KW - TRANSPORTATION NETWORKS

KW - EQUILIBRIUM ASSIGNMENT

KW - PASSENGER ASSIGNMENT

KW - RESERVE CAPACITY

KW - MARKET REGIMES

KW - ROAD NETWORK

KW - MODEL

KW - FREQUENCY

KW - UNCERTAINTY

U2 - 10.1016/j.trc.2011.09.001

DO - 10.1016/j.trc.2011.09.001

M3 - Journal article

VL - 35

SP - 286

EP - 304

JO - Transportation Research Part C: Emerging Technologies

JF - Transportation Research Part C: Emerging Technologies

SN - 0968-090X

ER -