Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Szeto, W. Y. | en_US |
dc.contributor.author | Jiang, Yu | en_US |
dc.contributor.author | Wong, K. I. | en_US |
dc.contributor.author | Solayappan, Muthu | en_US |
dc.date.accessioned | 2014-12-08T15:33:02Z | - |
dc.date.available | 2014-12-08T15:33:02Z | - |
dc.date.issued | 2013-10-01 | en_US |
dc.identifier.issn | 0968-090X | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/j.trc.2011.09.001 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/22998 | - |
dc.description.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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Transit assignment | en_US |
dc.subject | Reliability-based user equilibrium | en_US |
dc.subject | Linear Complementarity Problem | en_US |
dc.subject | Column generation | en_US |
dc.subject | Capacity constraint | en_US |
dc.subject | Chance constraint | en_US |
dc.title | Reliability-based stochastic transit assignment with capacity constraints: Formulation and solution method | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.trc.2011.09.001 | en_US |
dc.identifier.journal | TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES | en_US |
dc.citation.volume | 35 | en_US |
dc.citation.issue | en_US | |
dc.citation.spage | 286 | en_US |
dc.citation.epage | 304 | en_US |
dc.contributor.department | 運輸與物流管理系 註:原交通所+運管所 | zh_TW |
dc.contributor.department | Department of Transportation and Logistics Management | en_US |
dc.identifier.wosnumber | WOS:000326414400019 | - |
dc.citation.woscount | 6 | - |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.