Risk-Averse Traffic Assignment with Elastic Demands: NCP Formulation and Solution Method for Assessing Performance Reliability
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. Copyright Springer Science + Business Media, LLC 2006
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:6:y:2006:i:3:p:313-332. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F. Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.