ANALYTICAL DYNAMIC NETWORK LOADING PROBLEM: FORMULATION, SOLUTION ALGORITHMS, AND COMPUTER IMPLEMENTATIONS

摘要: The dynamic network loading problem is considered. This at the heart of analytical approaches to traffic assignment models. Given path flow rate and link travel time functions, consists determining time-dependent conditions, such as times, total number vehicles on links, inflow outflow rates. formulated a continuous-time system nonlinear equations expressing dynamics, conservation, propagation, boundary constraints. A discrete-time version model developed design solution algorithms. Two algorithms are implemented efficiently. Techniques described that were designed reduce memory usage computation times these Computational results with real-world emanating from Amsterdam A10 beltway, containing 300 nodes, 1,500 paths, 1,000 origin-destination pairs, 2 h analysis period indicate computer implementations can solve in min when small discretization interval 3.5 s used.