A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand

Suh-Wen Chiou

Applied Mathematics and Computation, 2015, vol. 266, issue C, 390-403

Abstract: A robust congestion pricing (ROPRICE) of signal-controlled road network is considered for equilibrium network flow with uncertain travel demand. A min–max bi-level program is presented to mitigate vulnerability of area traffic control road network against growing travel demand and reduce traffic congestion. A cutting plane projection approach (CPP) is proposed to effectively solve the ROPRICE problem with global convergence. Numerical computations are performed using various test road networks and comparisons are made with recently proposed heuristics. Computational results indicate that the proposed solution scheme can substantially achieve greater system performance as compared to other alternatives.

Keywords: Congestion pricing; Bi-level min–max model; Cutting plane method; Nash–Stackelberg game; Equilibrium flow (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315006256
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:266:y:2015:i:c:p:390-403

DOI: 10.1016/j.amc.2015.05.009

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().