A Dual Variable Approximation Based Heuristic for Dynamic Congestion Pricing

Dung Ying Lin, Avinash Unnikrishnan, Travis T. Waller

Research output: Contribution to journalArticlepeer-review

16 Citations (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%.

Original languageEnglish
Pages (from-to)271-293
Number of pages23
JournalNetworks and Spatial Economics
Issue number2
Publication statusPublished - 2011 Jun

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'A Dual Variable Approximation Based Heuristic for Dynamic Congestion Pricing'. Together they form a unique fingerprint.

Cite this