File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Risk-Averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability

TitleRisk-Averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability
Authors
KeywordsAlpha-basedbranch-and-bound
Elastic demand
Gapfunction
Non-linear complementarity problem
Risk-averse traffic assignment
Issue Date2006
PublisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1566-113x
Citation
Networks And Spatial Economics, 2006, v. 6 n. 3-4, p. 313-332 How to Cite?
AbstractHow reliable the transport network is greatly affects the mobility and economy of a country. To assess the reliability of the network accurately and design a reliable transport network properly, one should consider the risk taking and elastic behaviour of travel demand. This paper develops a Nonlinear Complementarity Problem (NCP) formulation considering this behaviour. The NCP formulation is transformed to a smooth and unconstrained mathematical program via a Fischer function and then solved by the proposed modified αBB (branch and bound) algorithm, while guaranteeing finite convergence to a point arbitrarily close to the global minimum (ε-convergence). To speed up the computation, a sampling method is suggested. A small numerical study is set up to illustrate the properties and the performance of the algorithm. The results show that the bound improving strategy, the sampling size on estimating the value of α for the convex lower bounding function, and choice of α have a strong influence of the rate of convergence. © Springer Science + Business Media, LLC 2006.
Persistent Identifierhttp://hdl.handle.net/10722/91209
ISSN
2015 Impact Factor: 3.25
2015 SCImago Journal Rankings: 2.120
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorSzeto, WYen_HK
dc.contributor.authorO'Brien, Len_HK
dc.contributor.authorO'Mahony, Men_HK
dc.date.accessioned2010-09-17T10:14:56Z-
dc.date.available2010-09-17T10:14:56Z-
dc.date.issued2006en_HK
dc.identifier.citationNetworks And Spatial Economics, 2006, v. 6 n. 3-4, p. 313-332en_HK
dc.identifier.issn1566-113Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/91209-
dc.description.abstractHow reliable the transport network is greatly affects the mobility and economy of a country. To assess the reliability of the network accurately and design a reliable transport network properly, one should consider the risk taking and elastic behaviour of travel demand. This paper develops a Nonlinear Complementarity Problem (NCP) formulation considering this behaviour. The NCP formulation is transformed to a smooth and unconstrained mathematical program via a Fischer function and then solved by the proposed modified αBB (branch and bound) algorithm, while guaranteeing finite convergence to a point arbitrarily close to the global minimum (ε-convergence). To speed up the computation, a sampling method is suggested. A small numerical study is set up to illustrate the properties and the performance of the algorithm. The results show that the bound improving strategy, the sampling size on estimating the value of α for the convex lower bounding function, and choice of α have a strong influence of the rate of convergence. © Springer Science + Business Media, LLC 2006.en_HK
dc.languageengen_HK
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1566-113xen_HK
dc.relation.ispartofNetworks and Spatial Economicsen_HK
dc.subjectAlpha-basedbranch-and-bounden_HK
dc.subjectElastic demanden_HK
dc.subjectGapfunctionen_HK
dc.subjectNon-linear complementarity problemen_HK
dc.subjectRisk-averse traffic assignmenten_HK
dc.titleRisk-Averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliabilityen_HK
dc.typeArticleen_HK
dc.identifier.emailSzeto, WY:ceszeto@hku.hken_HK
dc.identifier.authoritySzeto, WY=rp01377en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s11067-006-9286-7en_HK
dc.identifier.scopuseid_2-s2.0-33748134745en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33748134745&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6en_HK
dc.identifier.issue3-4en_HK
dc.identifier.spage313en_HK
dc.identifier.epage332en_HK
dc.identifier.eissn1572-9427-
dc.identifier.isiWOS:000241383500009-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridSzeto, WY=7003652508en_HK
dc.identifier.scopusauthoridO'Brien, L=23569876500en_HK
dc.identifier.scopusauthoridO'Mahony, M=7102575274en_HK
dc.identifier.citeulike1032396-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats