Heuristic Decision Policies for the Control of Reversible Traffic Links

Theodore S. Glickman
Additional contact information
Theodore S. Glickman: Boston University, Boston, Massachusetts

Transportation Science, 1973, vol. 7, issue 4, 362-376

Abstract: Mathematical models of the delays incurred in a traffic link with reversible lanes, as a function of demands for service and allocation decisions, are constructed assuming that the state of the operation is reviewed periodically. There is a penalty associated with each allocation change that is manifested as a loss of capacity. Heuristic algorithms are derived that enable the determination of decision policies that minimize the delay per vehicle during some horizon. The first phase of the determination is performed upon a basic model, in which the reversal penalties are ignored, and results in a sequence of optimal periodwise decisions. This policy is then subjected to a second phase, performed upon the lost time model, in which reversal penalties are included. Progressively better policies are generated in this phase according to the heuristic notion that an optimal policy does not differ much from the policy obtained in the first phase. The solution of the models is illustrated in a case study using actual data for the Chesapeake Bridge.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.7.4.362 (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:7:y:1973:i:4:p:362-376

Access Statistics for this article

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