Please use this identifier to cite or link to this item:
|Title:||Trial-and-error implementation of marginal-cost pricing on networks in the absence of demand functions||Authors:||Yang, H.
|Issue Date:||Jul-2004||Citation:||Yang, H., Meng, Q., Lee, D.-H. (2004-07). Trial-and-error implementation of marginal-cost pricing on networks in the absence of demand functions. Transportation Research Part B: Methodological 38 (6) : 477-493. ScholarBank@NUS Repository. https://doi.org/10.1016/S0191-2615(03)00077-8||Abstract:||Conventional analysis of optimal congestion pricing relies on three primary elements, namely, the speed-flow relationship, the demand function, and the generalized cost. Analytical demand functions tailed for congestion pricing are, however, difficult to establish in practice even with advanced transport modeling techniques. Inspired and motivated by the recent commentary and analytical works in the literature, this study proposes a trial-and-error implementation scheme of marginal-cost pricing on a general road network when the demand functions are unknown. Given a trial of a set of link tolls, the revealed aggregate link flows can be observed at ease; based on the observed link flows, a new set of link tolls can be determined and used for the next trial. We propose such an iterative toll adjustment procedure based on the method of successive averages, and present a rigorous theoretical proof of its convergence. The iterative procedure presented here allows for a traffic planner to estimate easily the socially optimal congestion tolls in a network without resorting to demand functions. © 2003 Elsevier Ltd. All rights reserved.||Source Title:||Transportation Research Part B: Methodological||URI:||http://scholarbank.nus.edu.sg/handle/10635/66338||ISSN:||01912615||DOI:||10.1016/S0191-2615(03)00077-8|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 5, 2020
WEB OF SCIENCETM
checked on Mar 20, 2020
checked on Mar 30, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.