DECOMPOSITION OF THE REACTIVE DYNAMIC ASSIGNMENTS WITH QUEUES FOR A MANY-TO-MANY ORIGIN-DESTINATION PATTERN

This research discusses the formulation and solution algorithm of the reactive dynamic traffic assignment with the link travel time explicit ly taking into account the effects of queues under the point queue con cept. In the reactive assignment, vehicles are assumed to choose their routes based on present instantaneous travel times. Time dependent ma ny-to-many origin-destination volumes are assumed to be given; that is , the departure times of vehicles from origins are known. We first dis cuss the formulation of the dynamic assignment so as to satisfy the fl ow conservation and the First-In-First-Out queue discipline. Then, the reactive assignment is shown to be decomposed with respect to present time, since route choices of Vehicles are dependent on the present tr affic situation but independent of the past and future traffic conditi on. An algorithm is finally proposed based upon the decomposition. Cop yright (C) 1996 Elsevier Science Ltd