TRAFFIC NETWORK EQUILIBRIA
Consider here a model of traffic flow on a road network. For each ordered pair of nodes there is a demand function which expresses travel demand between the two nodes as a function of travel times on the network. Each road (arc) has a delay function which expresses travel time on that arc as a function of total traffic flow. Our objective is to show how an equilibrium of travel times, flows, and demands may be computed under conditions which are simple, general, and plausible. To solve the network, problems techniques are developed for solving the stationary point problem.
- Supported in part by Contract EY-76-S-03-0326 and Grants DAAG29-78-G-0026, NSF-MCS77-05623, NSF-MCS76-81259, NSF-MCS76-20019 and NSF-ENG77-06761.
Stanford UniversityCalifornia Systems Optimization Laboratory
Stanford, CA United States 94305
- Asmuth, R L
- Publication Date: 1978-1
- Pagination: 48 p.
- TRT Terms: Density; Equilibrium (Mechanics); Mathematical models; Network analysis (Planning); Networks; Nodes (Networks); Programming (Mathematics); Time; Traffic; Traffic delays; Traffic flow; Travel demand; Travel time
- Uncontrolled Terms: Network flows
- Old TRIS Terms: Equilibrium general; Nodes; Point theorem
- Subject Areas: Highways; Operations and Traffic Management;
- Accession Number: 00180934
- Record Type: Publication
- Source Agency: National Technical Information Service
- Report/Paper Numbers: SOL-78-2, ARO-15254.1-M
- Contract Numbers: N00014-75-C-0865, N00014-75-C-0267
- Files: TRIS
- Created Date: Sep 14 1978 12:00AM