A Dual Variable Approximation Based Heuristic for Dynamic Congestion Pricing

Dung Ying Lin, Avinash Unnikrishnan, Travis T. Waller

研究成果: Article同行評審

16 引文 斯高帕斯(Scopus)


This work presents a heuristic combining dual variable approximation techniques and the method of successive average to determine the time-varying tolls in a general transportation network. The dual approximation techniques exploit the linear programming structure of the underlying assignment problem which uses the cell transmission model to propagate the traffic dynamics. Both the first best and second best time-varying tolls can be determined in a computationally efficient manner with the proposed heuristic. Numerical experiments are conducted on two networks of different sizes to show the efficacy of the heuristic. From the experiments conducted, the proposed heuristic obtains the solutions with the maximum optimality gap of 2. 03%.

頁(從 - 到)271-293
期刊Networks and Spatial Economics
出版狀態Published - 2011 6月

All Science Journal Classification (ASJC) codes

  • 軟體
  • 電腦網路與通信
  • 人工智慧


深入研究「A Dual Variable Approximation Based Heuristic for Dynamic Congestion Pricing」主題。共同形成了獨特的指紋。