Trial-and-error method for optimal credit schemes: The general network case

Xiaolei Wang, Hai Yang, Wei Liu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

Previous studies on the new congestion reduction method - tradable credit scheme rely on the full information of speed-flow relationship, demand function, and generalized cost. As analytical travel demand functions are difficult to establish in practice, this paper develops a trial-and-error method for selecting optimal credit schemes for general networks in the absence of demand functions, based on the method of successive average. Comparing with the converging speed of trial-and-error for congestion pricing proposed by Yang et al. (2004), we find that the trial-and-error method for tradable credits converges more slowly, but the generated traffic flows have a much smaller Euclidean distance to the SO flow pattern.

Original languageEnglish
Title of host publicationProceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012
Subtitle of host publicationTransportation and Logistics Management
Pages255-262
Number of pages8
Publication statusPublished - Dec 2012
Externally publishedYes

Publication series

NameProceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012: Transportation and Logistics Management

Keywords

  • Algorithm
  • Convergence
  • Network
  • Tradable credit scheme

ASJC Scopus subject areas

  • Transportation

Cite this