Please use this identifier to cite or link to this item:
|Title:||Road pricing for congestion control with unknown demand and cost functions|
|Citation:||Yang, H., Xu, W., He, B.-s., Meng, Q. (2010-04). Road pricing for congestion control with unknown demand and cost functions. Transportation Research Part C: Emerging Technologies 18 (2) : 157-175. ScholarBank@NUS Repository. https://doi.org/10.1016/j.trc.2009.05.009|
|Abstract:||It is widely recognized that precise estimation of road tolls for various pricing schemes requires a few pieces of information such as origin-destination demand functions, link travel time functions and users' valuations of travel time savings, which are, however, not all readily available in practice. To circumvent this difficulty, we develop a convergent trial-and-error implementation method for a particular pricing scheme for effective congestion control when both the link travel time functions and demand functions are unknown. The congestion control problem of interest is also known as the traffic restraint and road pricing problem, which aims at finding a set of effective link toll patterns to reduce link flows to below a desirable target level. For the generalized traffic equilibrium problem formulated as variational inequalities, we propose an iterative two-stage approach with a self-adaptive step size to update the link toll pattern based on the observed link flows and given flow restraint levels. Link travel time and demand functions and users' value of time are not needed. The convergence of the iterative toll adjustment algorithm is established theoretically and demonstrated on a set of numerical examples. © 2009 Elsevier Ltd. All rights reserved.|
|Source Title:||Transportation Research Part C: Emerging Technologies|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 21, 2018
WEB OF SCIENCETM
checked on Jun 11, 2018
checked on May 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.