File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s11067-006-9286-7
- Scopus: eid_2-s2.0-33748134745
- WOS: WOS:000241383500009
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Risk-Averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability
Title | Risk-Averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability |
---|---|
Authors | |
Keywords | Alpha-basedbranch-and-bound Elastic demand Gapfunction Non-linear complementarity problem Risk-averse traffic assignment |
Issue Date | 2006 |
Publisher | Springer 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? |
Abstract | How 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 Identifier | http://hdl.handle.net/10722/91209 |
ISSN | 2023 Impact Factor: 1.6 2023 SCImago Journal Rankings: 0.595 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Szeto, WY | en_HK |
dc.contributor.author | O'Brien, L | en_HK |
dc.contributor.author | O'Mahony, M | en_HK |
dc.date.accessioned | 2010-09-17T10:14:56Z | - |
dc.date.available | 2010-09-17T10:14:56Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | Networks And Spatial Economics, 2006, v. 6 n. 3-4, p. 313-332 | en_HK |
dc.identifier.issn | 1566-113X | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/91209 | - |
dc.description.abstract | How 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.language | eng | en_HK |
dc.publisher | Springer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1566-113x | en_HK |
dc.relation.ispartof | Networks and Spatial Economics | en_HK |
dc.subject | Alpha-basedbranch-and-bound | en_HK |
dc.subject | Elastic demand | en_HK |
dc.subject | Gapfunction | en_HK |
dc.subject | Non-linear complementarity problem | en_HK |
dc.subject | Risk-averse traffic assignment | en_HK |
dc.title | Risk-Averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Szeto, WY:ceszeto@hku.hk | en_HK |
dc.identifier.authority | Szeto, WY=rp01377 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s11067-006-9286-7 | en_HK |
dc.identifier.scopus | eid_2-s2.0-33748134745 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33748134745&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 6 | en_HK |
dc.identifier.issue | 3-4 | en_HK |
dc.identifier.spage | 313 | en_HK |
dc.identifier.epage | 332 | en_HK |
dc.identifier.eissn | 1572-9427 | - |
dc.identifier.isi | WOS:000241383500009 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Szeto, WY=7003652508 | en_HK |
dc.identifier.scopusauthorid | O'Brien, L=23569876500 | en_HK |
dc.identifier.scopusauthorid | O'Mahony, M=7102575274 | en_HK |
dc.identifier.citeulike | 1032396 | - |
dc.identifier.issnl | 1566-113X | - |