On a Ramp-Flow Assignment Problem

C. F. Wang
Additional contact information
C. F. Wang: University of Pittsburgh, Pittsburgh, Pennsylvania

Transportation Science, 1972, vol. 6, issue 2, 114-130

Abstract: The formulation of ramp-flow assignment problem in the operations of controlled expressways during the rush-hour period is presented here. In order to discuss the problem on a quantitative basis, a simple unidirectional expressway system with multiple entrance-ramps has been selected as the model. When the flow throughout the system can be maintained below the bottleneck capacity of the expressway, the condition of steady flow prevails, and the model may be regarded as a dynamic process in the direction of flow. The ramp-flow regulation problem in an expressway system is then formulated as a multistage decision process by considering the ramp-flows as decision variables. Various criteria for selecting the optimum ramp-flow assignment are discussed and their implications in the regulation of rush-hour traffic are illustrated through a simple example. In the example, the technique of dynamic programming was used successfully to determine the optimum policy that minimizes the system congestion period and the results led to the conclusion that the two-switching policy is the best optimum policy with respect to the stated objective for a three-stage process.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.6.2.114 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:6:y:1972:i:2:p:114-130

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().