Optimal road tolls under conditions of queueing and congestion
Urban road networks in Hong Kong are highly congested, particularly during peak periods. Long vehicle queues at bottlenecks, such as the harbor tunnels, have become a daily occurrence. At present, tunnel tolls are charged in Hong Kong as one means to reduce traffic congestion. In general, flow pattern and queue length on a road network are highly dependent on traffic control and road pricing. An efficient control scheme must, therefore, take into account the effects of traffic control and road pricing on network flow. In this paper, we present a bi-level programming approach for determination of road toll pattern. The lower-level problem represents a queueing network equilibrium model that describes users' route choice behavior under conditions of both queueing and congestion. The upper-level problem is to determine road tolls to optimize a given system's performance while considering users' route choice behavior. Sensitivity analysis is also performed for the queueing network equilibrium problem to obtain the derivatives of equilibrium link flows with respect to link tolls. This derivative information is then applied to the evaluation of alternative road pricing policies and to the development of heuristic algorithms for the bi-level road pricing problem. The proposed model and algorithm are illustrated with numerical examples.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 30 (1996)
Issue (Month): 5 (September)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Yang, Hai & Yagar, Sam & Iida, Yasunori & Asakura, Yasuo, 1994. "An algorithm for the inflow control problem on urban freeway networks with user-optimal flows," Transportation Research Part B: Methodological, Elsevier, vol. 28(2), pages 123-139, April.
- Arnott, R. & de Palma, A. & Lindsey, R., 1990. "Departure time and route choice for the morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 209-228, June.
- Yang, Hai & Yagar, Sam, 1995. "Traffic assignment and signal control in saturated road networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 125-139, March.
- Smith, M. J., 1979. "The marginal cost taxation of a transportation network," Transportation Research Part B: Methodological, Elsevier, vol. 13(3), pages 237-242, September.
- Laih, Chen-Hsiu, 1994. "Queueing at a bottleneck with single- and multi-step tolls," Transportation Research Part A: Policy and Practice, Elsevier, vol. 28(3), pages 197-208, May.
- Yang, Hai & Yagar, Sam, 1994. "Traffic assignment and traffic control in general freeway-arterial corridor systems," Transportation Research Part B: Methodological, Elsevier, vol. 28(6), pages 463-486, December.
- Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:30:y:1996:i:5:p:319-332. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.