We consider a general traffic corridor consisting of two subsystems of a freeway network and a surface street network. The two systems are coupled by access ramps to provide multiple alternative routes for drivers from their origins to destinations. Each ramp can be metered to influence flow distributions in such a way that some system performance index (e.g. total travel time) is optimized, provided that each driver chooses an individual minimum cost route in response to any given ramp control. In this article we first present a bilevel programming formulation of the traffic assignment and traffic control problem in the traffic corridor system. The lower-level problem represents a traffic equilibrium model involving explicitly ramp queuing, which predicts how drivers will react to any given on-ramp control pattern. The upper-level problem is to determine ramp metering rates that optimize a system performance criterion, taking into account drivers' route choice behavior. We also present a sensitivity analysis for the queuing network equilibrium problem. Explicit expression of the derivatives of equilibrium link flows and equilibrium ramp queuing times with respect to ramp metering rates is derived. A heuristic algorithm, using the derivative information from the sensitivity analysis, is developed to solve the proposed bilevel on-ramp traffic control problem. A numerical example is provided to illustrate the bilevel control model and the solution algorithm.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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): 28 (1994) Issue (Month): 6 (December) Pages: 463-486 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).
Related research
Keywords:
Cited by: (explanations, 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.)
Correa, Jose R. & Schulz, Andreas S. & Stier Moses, Nicolas E., 2003.
"Selfish Routing in Capacitated Networks,"
Working papers
4319-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
[Downloadable!]