As more and more cities in worldwide are facing the problems of traffic jam, governments have been concerned about how to design transportation networks with adequate capacity to accommodate travel demands. To evaluate the capacity of a transportation system, the prescribed origin and destination (O-D) matrix for existing travel demand has been noticed to have a significant effect on the results of network capacity models. However, the exact data of the existing O-D demand are usually hard to be obtained in practice. Considering the fluctuation of the real travel demand in transportation networks, the existing travel demand is represented as uncertain parameters which are defined within a bounded set. Thus, a robust reserve network capacity (RRNC) model using min–max optimization is formulated based on the demand uncertainty. An effective heuristic approach utilizing cutting plane method and sensitivity analysis is proposed for the solution of the RRNC problem. Computational experiments and simulations are implemented to demonstrate the validity and performance of the proposed robust model. According to simulation experiments, it is showed that the link flow pattern from the robust solutions to network capacity problems can reveal the probability of high congestion for each link.

Document type: Article

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

https://doaj.org/toc/2042-3195 under the license http://creativecommons.org/licenses/by/4.0/
Back to Top

Document information

Published on 01/01/2017

Volume 2017, 2017
DOI: 10.1155/2017/9814909
Licence: Other

Document Score


Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?