英文摘要 |
Time-dependent Origin-Destination (O-D) demand data is critical to thesuccess of Dynamic Traffic Assignment in Advanced Traffic ManagementSystems (ATMS), and extensive research has been conducted in the past decadeto tackle this problem. This research applies the One-to-All Flow Simulationmethod to generate the single origin to multiple destinations flows andaggregates simulated flows with detector flows to estimate possible O-D splitsbased on the non-assignment based model. The unique features of the modelinclude: (1) the One-to-All Flow Simulation, which is utilized to calculate theO-D splits supplies the additional link counts data; (2) the destination-basedCordon-line supplies a method to estimate O-D splits with sparsely-distributeddetectors. (3) the path travel time is calculated based on the space mean speedof all vehicles taking the shortest path from origins to destinations, suitable forcongested links and a signalized urban network; Numerical experiments toillustrate the proposed model are conducted in three networks: a small testnetwork, a signalized urban network and a mixed network, and severalsensitivity analyses are performed. The numerical results show that the rootmean square error (RMSE) of the signalized urban network is 0.047; theestimated O-D splits from the proposed model are reasonable and acceptable. |