Network Optimization with Continuous Control Parameters

Transportation SciencePublished 1 May 1983

Patrice Marcotte

DOI10.1287/trsc.17.2.181

Source URL

Citations182

SJR quartileQ1

SJR score2.32

SNIP2.03

TL;DR

This paper considers two network optimization problems which have the following characteristics: control parameters vary continuously and network users behave according to War-drop's first principle of traffic equilibrium (“user-optimization”).

Abstract

In this paper we consider two network optimization problems which have the following characteristics: control parameters vary continuously and network users behave according to War-drop's first principle of traffic equilibrium (“user-optimization”). For each problem, we study an exact algorithm based on constraint accumulation and a heuristic algorithm previously proposed in the literature.

Keywords

Social SciencesEngineering

Transportation ScienceTraffic Equilibrium and Variational Inequalities

935 Citations1980Stella Dafermos

This work uses the techniques of the theory of variational inequalities to establish existence of a traffic equilibrium pattern, to design an algorithm for the construction of this pattern and to derive estimates on the speed of convergence of the algorithm.

Transportation Research Part B MethodologicalThe existence, uniqueness and stability of traffic equilibria

857 Citations1979Mike Smith

The paper formulates link-flow definitions of equilibrium and stability, and gives conditions which guarantee the existence, uniqueness and stability of traffic equilibria.

Transportation Research Part B MethodologicalContinuous equilibrium network design models

392 Citations1979Mustafa Abdulaal, Larry J. LeBlanc

This work formulate the network design problem with continuous investment variables subject to equilibrium assignment as a nonlinear optimization problem and shows that this optimization problem is equivalent to an unconstrained problem which it is shown to solve by direct search techniques.

Transportation Research Part B MethodologicalFormulating and solving the network design problem by decomposition

127 Citations1979George B. Dantzig, R. P. Harvey +3 more

The optimal transportation network design problem is formulated as a convex nonlinear programming problem and a solution method based on standard traffic assignment algorithms is presented, demonstrating that it is capable of solving very large problems with reasonable amounts of computer time.

IMA Journal of Applied MathematicsDelay-minimizing Settings for Fixed-time Traffic Signals at a Single Road Junction

119 Citations1971Richard Allsop

A new method finds settings that minimize the estimated average delay per unit time to all traffic passing through the road junction, subject to certain constraints imposed by the traffic engineer.

Transportation Research Part B MethodologicalProperties of a traffic control policy which ensure the existence of a traffic equilibrium consistent with the policy

67 Citations1981Mike Smith

In the mathematical model, traffic flows at one junction do not affect costs at others; this is the most important restriction on the work presented here.

Rosa P: A digital library for transportation research (United States Department of Transportation)HYBRID OPTIMIZATION IN URBAN TRAFFIC NETWORKS

65 Citations1979Huachen Tan, Stanley B. Gershwin +1 more

The hybrid optimization problem is formulated to provide a general theoretical framework for the analysis of a class of traffic control problems which takes into account the role of individual drivers as independent decisionmakers.

View PDF