BOUNDING THE SOLUTION OF THE CONTINUOUS EQUILIBRIUM NETWORK DESIGN PROBLEM

Patrick T. Harker · Terry L. Friesz

39 citations0/0 files stored

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Game Theory and Applications

Abstract

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)

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 39 citations exist upstream.

Cited by

1991Multi-level programming and conflict resolution 2015Capacity uncertainty on urban road networks: A critical state and its applicability in resilience quantification 1998Stochastic User Equilibrium Traffic Assignment with Turn‐delays in Intersections 1995Network Design Models and Methods for Urban Traffic Management 1999Solving Bilevel Network Design Problem Using a Linear Reaction Function Without Nondegeneracy Assumption 1986Road traffic assignment — a review 1987AN OPTIMAL ROAD NETWORK DESIGN MODEL WITH VARIABLE OD TRAVEL DEMAND 1999Continuous Equilibrium Network Design Problem with Elastic Demand

Imported from OpenAlex (CC0) — nothing here is generated.