Trial and error method for optimal tradable credit schemes: The network case |
| |
| Authors: | Xiaolei Wang Hai Yang Deren Han Wei Liu |
| |
| Institution: | 1. Sino‐US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, China;2. Department of Civil and Environmental Engineering, The Hong Kong University of Science and Technology, Hong Kong, China;3. School of Mathematics and Computer Sciences, Nanjing Normal University, Nanjing, China |
| |
| 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. Copyright © 2013 John Wiley & Sons, Ltd. |
| |
| Keywords: | algorithm convergence tradable credit scheme equilibrium network |
|
|
