Abstract
This paper compares the dynamic flow patterns on two symmetrical networks: “Evening-network” which is a network with a one-to-many OD pattern; “Morning-network” which is one with a many-to-one OD pattern that can be obtained by reversing the direction of links, an origin and destinations of the Evening-network. Although the conventional static traffic assignment produces exactly the same flow pattern for both of the networks, we nevertheless find that such a simple conclusion does not hold for dynamic assignment models. As an example demonstrating the essential difference between the two dynamic flow patterns, a capacity increasing paradox (dynamic version of Braess's paradox) is also discussed
