Network assignment distributes Origin-Destination (OD) trips in a network, and determines the flow patterns in a traffic network. This research aims at developing simulation-based algorithm for dynamic traffic assignment problems under mixed traffic flow considerations. The algorithm consists of an inner loop that incorporates a direction finding mechanism for the search process for System Optimization (SO) and User Equilibrium (UE) classes based on the simulation results of the current iteration, including experienced vehicular trip times and marginal trip times. Convergence is sought by obtaining search directions for the SO and UE classes. The core is a simulation-assignment model, DynaTAIWAN (Dynamic Traffic Assignment and Information for Wide Area Networks), that allows consideration of individual tripmaker decisions at the origin as well as at each node along the way to the destination, in addition to describing the dynamics of vehicular traffic flow.
|出版狀態||Published - 2006 一月 1|
|事件||13th World Congress on Intelligent Transport Systems and Services, ITS 2006 - London, United Kingdom|
持續時間: 2006 十月 8 → 2006 十月 12
|Other||13th World Congress on Intelligent Transport Systems and Services, ITS 2006|
|期間||06-10-08 → 06-10-12|
All Science Journal Classification (ASJC) codes