File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleReliability-based stochastic transit assignment with capacity constraints: formulation and solution method
Authors
KeywordsCapacity constraint
Chance constraint
Column generation
Linear complementarity problem
Reliability-based user equilibrium
Issue Date2013
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trc
Citation
Transportation Research Part C: Emerging Technologies, 2013, v. 35, p. 286-304 How to Cite?
AbstractThis 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 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. © 2011 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/143742
ISSN
2015 Impact Factor: 3.075
2015 SCImago Journal Rankings: 2.062
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorSzeto, WYen_HK
dc.contributor.authorJiang, Yen_HK
dc.contributor.authorWong, KIen_HK
dc.contributor.authorSolayappan, Men_HK
dc.date.accessioned2011-12-21T08:48:06Z-
dc.date.available2011-12-21T08:48:06Z-
dc.date.issued2013en_HK
dc.identifier.citationTransportation Research Part C: Emerging Technologies, 2013, v. 35, p. 286-304en_HK
dc.identifier.issn0968-090Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/143742-
dc.description.abstractThis 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 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. © 2011 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_US
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trcen_HK
dc.relation.ispartofTransportation Research Part C: Emerging Technologiesen_HK
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Transportation Research Part C: Emerging Technologies. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Transportation Research Part C: Emerging Technologies. DOI: 10.1016/j.trc.2011.09.001-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCapacity constrainten_HK
dc.subjectChance constrainten_HK
dc.subjectColumn generationen_HK
dc.subjectLinear complementarity problemen_HK
dc.subjectReliability-based user equilibriumen_HK
dc.titleReliability-based stochastic transit assignment with capacity constraints: formulation and solution methoden_HK
dc.typeArticleen_HK
dc.identifier.emailSzeto, WY: ceszeto@hku.hken_HK
dc.identifier.authoritySzeto, WY=rp01377en_HK
dc.description.naturepostprint-
dc.identifier.doi10.1016/j.trc.2011.09.001en_HK
dc.identifier.scopuseid_2-s2.0-84885036449en_HK
dc.identifier.hkuros198018en_US
dc.identifier.isiWOS:000326414400019-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridSolayappan, M=35605031200en_HK
dc.identifier.scopusauthoridWong, KI=7404760031en_HK
dc.identifier.scopusauthoridJiang, Y=37067394500en_HK
dc.identifier.scopusauthoridSzeto, WY=7003652508en_HK
dc.identifier.citeulike9949143-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats