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

作者:

Highlights:

摘要

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.

论文关键词:Congestion pricing,Bi-level min–max model,Cutting plane method,Nash–Stackelberg game,Equilibrium flow

论文评审过程:Received 26 March 2014, Revised 8 March 2015, Accepted 3 May 2015, Available online 11 June 2015, Version of Record 11 June 2015.

论文官网地址:https://doi.org/10.1016/j.amc.2015.05.009