Abstract
In this paper we address the traffic assignment problem, equivalent to the first Wardrop conditions of user equilibrium. We demonstrate that a large number of solution techniques employed can be described in a unified setting through the concept of partial linearization. The global convergence of this class of methods is discussed. We provide a number of examples of instances of the class of algorithms defined, for cases of separable travel cost formulas as well as for models including link interactions. In the latter case, the class of partial linearization algorithms are shown to yield contributions to the theory of finite-dimensional variational inequalities. We also present a variant of this algorithmic class, based on truncated solutions of the subproblems. The convergence of the truncated partial linearization algorithm is established, and implementational aspects are discussed. 75 refs.
Citation Formats
Patriksson, M.
A unified description of some iterative algorithms for traffic equilibria.
Sweden: N. p.,
1991.
Web.
Patriksson, M.
A unified description of some iterative algorithms for traffic equilibria.
Sweden.
Patriksson, M.
1991.
"A unified description of some iterative algorithms for traffic equilibria."
Sweden.
@misc{etde_10133878,
title = {A unified description of some iterative algorithms for traffic equilibria}
author = {Patriksson, M}
abstractNote = {In this paper we address the traffic assignment problem, equivalent to the first Wardrop conditions of user equilibrium. We demonstrate that a large number of solution techniques employed can be described in a unified setting through the concept of partial linearization. The global convergence of this class of methods is discussed. We provide a number of examples of instances of the class of algorithms defined, for cases of separable travel cost formulas as well as for models including link interactions. In the latter case, the class of partial linearization algorithms are shown to yield contributions to the theory of finite-dimensional variational inequalities. We also present a variant of this algorithmic class, based on truncated solutions of the subproblems. The convergence of the truncated partial linearization algorithm is established, and implementational aspects are discussed. 75 refs.}
place = {Sweden}
year = {1991}
month = {Jul}
}
title = {A unified description of some iterative algorithms for traffic equilibria}
author = {Patriksson, M}
abstractNote = {In this paper we address the traffic assignment problem, equivalent to the first Wardrop conditions of user equilibrium. We demonstrate that a large number of solution techniques employed can be described in a unified setting through the concept of partial linearization. The global convergence of this class of methods is discussed. We provide a number of examples of instances of the class of algorithms defined, for cases of separable travel cost formulas as well as for models including link interactions. In the latter case, the class of partial linearization algorithms are shown to yield contributions to the theory of finite-dimensional variational inequalities. We also present a variant of this algorithmic class, based on truncated solutions of the subproblems. The convergence of the truncated partial linearization algorithm is established, and implementational aspects are discussed. 75 refs.}
place = {Sweden}
year = {1991}
month = {Jul}
}