CONVERGENCE OF A NETWORK DECOMPOSITION ALGORITHM FOR THE TRAFFIC EQUILIBRIUM MODEL
The author establishes the convergence of a network decomposition algorithm by origin-destination pairs designed to solve the general asymmetric network equilibrium problem. Using the variational inequality formulation of the equilibrium conditions, the author establishes linear convergence under the assumption that the paths joining different origin-destination pairs are weakly coupled. For the covering abstract of the symposium see TRIS 452544. (Author/TRRL)
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/isbn/0802024610
-
Supplemental Notes:
- Proceedings of the Eighth International Symposium on Transportation and Traffic Theory, Toronto, Canada, June 24-26, 1981.
-
Corporate Authors:
Toronto University Press
Front Campus
Toronto, Ontario Canada M5S 1A6Toronto University Press
33 East Tupper Street
Buffalo, NY United States 14208 -
Authors:
- Hurdle, V F
- Hauser, E
- Dafermos, S
- Conference:
- Publication Date: 1983
Media Info
- Features: References;
- Pagination: p. 143-156
Subject/Index Terms
- TRT Terms: Algorithms; Conferences; Decomposition; Demand; Equilibrium (Mechanics); Mathematical models; Networks; Origin and destination; Symmetry; Traffic simulation; Transportation modes
- Uncontrolled Terms: Convergence; One; Transportation networks
- ITRD Terms: 8525: Conference; 285: Demand (econ); 7145: Equilibrium; 6473: Mathematical model; 1054: Network (traffic); 9054: One; 687: Origin destination traffic; 6425: Symmetry; 1145: Transport mode
- Subject Areas: Highways; Planning and Forecasting;
Filing Info
- Accession Number: 00452552
- Record Type: Publication
- Source Agency: Transport Research Laboratory
- ISBN: 0 8020 2461 0
- Files: ITRD, TRIS
- Created Date: Jul 31 1986 12:00AM