Trial and error method for optimal tradable credit schemes: the network case

Wang, X., Yang, H., Han, D. and Liu, W. (2014) Trial and error method for optimal tradable credit schemes: the network case. Journal of Advanced Transportation, 48(6), pp. 685-700. (doi: 10.1002/atr.1245)

Full text not currently available from Enlighten.

Abstract

Recent 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. After each trial of tradable credit scheme, the credit charging scheme and total amount of credits to be distributed are updated by both observed link flows at traffic equilibrium and revealed credit price at market equilibrium. The updating strategy is based on the method of successive averages and its convergence is established theoretically. Our numerical experiments demonstrate that the method of successive averages based trial and error method for tradable credit schemes has a lower convergence speed in comparison with its counterpart for congestion pricing and could be enhanced by exploring more efficient methods that make full use of credit price information.

Item Type:Articles
Keywords:Algorithm, convergence, tradable credit scheme, equilibrium, network.
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Liu, Dr Wei
Authors: Wang, X., Yang, H., Han, D., and Liu, W.
Subjects:T Technology > TA Engineering (General). Civil engineering (General)
College/School:College of Science and Engineering > School of Engineering > Infrastructure and Environment
Journal Name:Journal of Advanced Transportation
Publisher:John Wiley & Sons, Ltd.
ISSN:0197-6729
ISSN (Online):2042-3195
Published Online:05 August 2013

University Staff: Request a correction | Enlighten Editors: Update this record