ACCESS CONTROL ON NETWORKS
WITH UNIQUE ORIGIN-DESTINATION PATHS

David J. Lovell

Department of Civil Engineering,
University of Maryland, College Park, MD 20742, U.S.A.

and

Carlos F. Daganzo

Institute of Transportation Studies
University of California, Berkeley CA 94720, U.S.A.


ABSTRACT

This paper presents improved time-dependent control strategies for small freeway networks with bottlenecks and unique origin-destination paths. It is assumed that there are no spill-overs from any of the freeway exits so that freeway queues and delays ca n be completely avoided by regulating access to the system so as to maintain bottleneck flows strictly below capacity. It is also assumed that the time-dependent origin-destination table and the time-dependent bottleneck capacities are known, although no t always a priori. The proposed control strategies attempt to minimize the total delay (including both system delay and access delay) while avoiding queues inside the system. The problem is formulated as a constrained calculus of variations exercis e that can be cast in the conventional form of optimal control theory, and can also be discretized as a mathematical program. Although the first-in-first-out requirement for the access introduces undesirable nonlinearities, exact solutions for four impor tant special cases can be obtained easily. More specifically, for networks with (1) a single origin or (2) a single bottleneck, a myopic strategy which requires the solution of a sequence of simple linear programs is optimal. For networks with (3) a singl e destination the nonlinearities disappear and the problem becomes a large-scale linear program. This is also true for general networks if (4) the fractional distribution of flows across destinations for every origin is independent of time. A greedy heuri stic algorithm is proposed for the general case. It has been programmed for a personal computer running Windows. The algorithm is non-anticipative in that it regulates access at the current time without using future information. As a result, it is computa tionally efficient and can be bolstered with dynamically-updated information. Globally, optimal for cases (1) and (2), the heuristic has been developed with slow-varying O-D tables in mind. Significant improvements will likely require anticipatory informa tion. An illustrative example is given.


Go back to Carlos Daganzo's Publications Page


Document maintained on server: http://www.ce.berkeley.edu/
Last update 6/21/99