原文传递
ANALYTICAL DYNAMIC NETWORK LOADING PROBLEM: FORMULATION, SOLUTION ALGORITHMS, AND COMPUTER IMPLEMENTATIONS.
| 题名： | ANALYTICAL DYNAMIC NETWORK LOADING PROBLEM: FORMULATION, SOLUTION ALGORITHMS, AND COMPUTER IMPLEMENTATIONS. |
| 作者： | Chabini-I |
| 关键词： | Algorithms-; Computation-time; Discretization-interval; Dynamic-network-loading; Dynamic-traffic-assignment; Links-Networks; Nonlinear-equations; Traffic-models; Travel-time |
| 摘要： | The dynamic network loading problem is considered. This problem is at the heart of analytical approaches to dynamic traffic assignment models. Given path flow rate and link travel time functions, the dynamic network loading problem consists of determining time-dependent network flow conditions, such as link travel times, total number of vehicles on links, and link inflow and outflow rates. The dynamic network loading problem is formulated as a continuous-time system of nonlinear equations expressing link dynamics, flow conservation, flow propagation, and boundary constraints. A discrete-time version of the continuous-time model is developed to design solution algorithms. Two solution algorithms are developed and implemented efficiently. Techniques are described that were designed to reduce memory usage and computation times of these solution algorithms. Computational results with a real-world traffic network emanating from the Amsterdam A10 beltway, containing 300 nodes, 1,500 paths, 1,000 origin-destination pairs, and 2 h of analysis period indicate that the developed computer implementations can solve the network loading problem in 2 min when a small discretization interval of 3.5 s is used. |
| 总页数： | Transportation Research Record. 2001. (1771) pp191-200 (6 Fig., 2 Tab., 21 Ref.) |
| 报告类型： | 科技报告 |
相关文献
- DYNAMIC TRAFFIC ASSIGNMENT : AN ANALYTICAL TOOL AND ITS APPLICATION.
- Discrete Dynamic Shortest Path Problems in Transportation Applications Complexity and Algorithms with Optimal Run Time
- ADAPTATIONS OF THE A* ALGORITHM FOR DYNAMIC SHORTEST PATH PROBLEMS.
- Large-Scale Linear Optimization through Machine Learning: From Theory to Practical System Design and Implementation. Technical Report May 28-May 27, 2016.
- BIT-STREAM REPRESENTATION OF TIME-DEPENDENT DATA : APPLICATIONS TO DATA COMMUNICATION AND PROCESSING.
- COMPUTING FASTEST PATHS IN CONTINUOUS-TIME DYNAMIC NETWORKS WITH PIECEWISE LINEAR LINK TRAVEL-TIME FUNCTIONS.
检索历史
应用推荐
