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 explicitly taking into account the effects of queues under the point queue concept. In the reactive assignment, vehicles are assumed to choose their routes based on present instantaneous travel times. Time dependent many-to-many origin-destination volumes are assumed to be given; that is, the departure times of vehicles from origins are known. We first discuss the formulation of the dynamic assignment so as to satisfy the flow 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 traffic situation but independent of the past and future traffic condition. An algorithm is finally proposed based upon the decomposition.