Add to ORKGIn this paper we present a version of the (static) traffic equilibrium problem in which the cost incurred on a path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classical additivity assumption fails. We also present an algorithm for solving nonadditive problems that is based on the recent NE/SQP algorithm, a fast and robust method for the nonlinear complementarity problem. Finally, we present a small example that illustrates both the importance of using nonadditive costs and the effectiveness of the NE/SQP method
In this paper we propose a new iterative method for solving the asymmetric traffic equilibrium probl...
The paper presents a new algorithm for traffic assignment, called LUCE, which iteratively solves a s...
In the last decade, as calibrations of the classical traffic equilibrium problems, various models of...
In this paper we present a version of the (static) trac equilibrium problem in which the cost incurr...
. In this paper we develop an algorithm for solving a version of the (static) traffic equilibrium pr...
In this paper we present a version of the (static) traffic equilibrium problem in which the cost inc...
Using a new gap function recently proposed by Facchinei and Soares [Facchinei, F., Soares, J., 1995....
AbstractThe traditional traffic equilibrium problem (TEP) is mainly based on the additivity assumpti...
Various models of traffic equilibrium problems (TEPs) with nonadditive route costs have been propose...
The most commonly used traffic assignment (TA) model is known as user equilibrium, which assumes tha...
AbstractA bicriterion shortest path problem with a general nonadditive cost seeks to optimize a comb...
In this paper, we demonstrate when and why existing algorithms fail to give coherent results to the ...
The purpose of this paper is to provide a unified description of iterative algorithms for the soluti...
This article examines the application of a path-based algorithm to the static and fixed demand asymm...
We present a short, geometric proof for the price-of-anarchy results that have recently been establi...
In this paper we propose a new iterative method for solving the asymmetric traffic equilibrium probl...
The paper presents a new algorithm for traffic assignment, called LUCE, which iteratively solves a s...
In the last decade, as calibrations of the classical traffic equilibrium problems, various models of...
In this paper we present a version of the (static) trac equilibrium problem in which the cost incurr...
. In this paper we develop an algorithm for solving a version of the (static) traffic equilibrium pr...
In this paper we present a version of the (static) traffic equilibrium problem in which the cost inc...
Using a new gap function recently proposed by Facchinei and Soares [Facchinei, F., Soares, J., 1995....
AbstractThe traditional traffic equilibrium problem (TEP) is mainly based on the additivity assumpti...
Various models of traffic equilibrium problems (TEPs) with nonadditive route costs have been propose...
The most commonly used traffic assignment (TA) model is known as user equilibrium, which assumes tha...
AbstractA bicriterion shortest path problem with a general nonadditive cost seeks to optimize a comb...
In this paper, we demonstrate when and why existing algorithms fail to give coherent results to the ...
The purpose of this paper is to provide a unified description of iterative algorithms for the soluti...
This article examines the application of a path-based algorithm to the static and fixed demand asymm...
We present a short, geometric proof for the price-of-anarchy results that have recently been establi...
In this paper we propose a new iterative method for solving the asymmetric traffic equilibrium probl...
The paper presents a new algorithm for traffic assignment, called LUCE, which iteratively solves a s...
In the last decade, as calibrations of the classical traffic equilibrium problems, various models of...