A Reactive Dynamic Assignment Scheme

Abstract

In this paper we consider two traffic control strategies relying on user response to information and/or flow restriction. Ultimately, the control strategies are designed to function in real time, hence provide command values based on actual conditions and requiring little computational effort. The proposed control strategies are based on the idea that the network load, as measured by instantaneous travel times for instance, should be shared as equally as possible between paths. In order to achieve such an aim, the commands are designed to make the system state converge towards a state in which instantaneous travel times of paths relative to any given OD tend to be equal.

Citation

Khoshyaran, M.M. and Lebacque, J.P. (1998), "A Reactive Dynamic Assignment Scheme", Griffiths, J.D. (Ed.) Mathematics in Transport Planning and Control, Emerald Group Publishing Limited, Leeds, pp. 131-143. https://doi.org/10.1108/9780585474182-013