BOUNDING THE SOLUTION OF THE CONTINOUS EQUILIBRIUM NETWORK DESIGN PROBLEM
The solution of the optimal equilibrium network design problem is perhaps the most computationally intensive problem encountered in transportation network analysis. This paper illustrates through the use of game-theoretic concepts how one can bound the solution of the continuous version of this problem by using two computationally efficient heuristics. This bounding procedure can then be used to assess whether or not it is necessary to solve for the exact solution to this problem. A numerical example is presented which illustrates this procedure. (Author/TRRL)
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/isbn/9067640085
-
Supplemental Notes:
- Papers presented during the Ninth International Symposium on Transportation and Traffic Theory held in Delft the Netherlands, 11-13 July 1984.
-
Corporate Authors:
VNU Science Pres BV
P.O. Box 2073
Utrecht, Netherlands -
Authors:
- Harker, P T
- Friesz, T L
- Conference:
- Publication Date: 1984
Media Info
- Features: Figures; References; Tables;
- Pagination: p. 233-252
Subject/Index Terms
- TRT Terms: Conferences; Costs; Design; Equilibrium (Mechanics); Game theory; Heuristic methods; Improvements; Mathematical models; Networks; Origin and destination; Planning; Roads; Traffic; Traffic control
- Uncontrolled Terms: Road networks
- ITRD Terms: 8525: Conference; 224: Cost; 9011: Design (overall design); 7145: Equilibrium; 9108: Improvement; 6473: Mathematical model; 687: Origin destination traffic; 143: Planning; 1053: Road network; 755: Traffic
- Subject Areas: Design; Finance; Highways; Operations and Traffic Management; Planning and Forecasting; I71: Traffic Theory;
Filing Info
- Accession Number: 00392086
- Record Type: Publication
- Source Agency: Institute for Road Safety Research, SWOV
- ISBN: 90-6764-008-5
- Files: ITRD, TRIS
- Created Date: Apr 29 1985 12:00AM