The general traffic assignment problem: a proximal point method for equilibrium computation with application to the demand adjustment problem
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/89274
Tipus de documentReport de recerca
Data publicació2003
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
An adaptation of the proximal algorithm for the traffic assignment problem under a user
equilibrium formulation for a general asymmetric traffic network is presented in this
paper, following the recently published results of Pennanen regarding convergence under
nonmonotonicity. As is well known the problem can be formulated as a variational
inequality and the algorithmic solutions developed uptodate guarantee convergence
only under too restrictive conditions which are difficult to appear in practice. In this
paper new conditions guaranteing convergence are developed and the possibility of
including the algorithm on a bilevel scheme is discussed
Descripció
Presented at the SEIO (Sociedad Española de Estadística e Investigació Operativa) Congress 2003, Lleida 8 to 11th April.
CitacióLídia Montero, Codina, E. "The general traffic assignment problem: a proximal point method for equilibrium computation with application to the demand adjustment problem". 2003.
Forma partDR 2003/08
URL repositori externhttp://cataleg.upc.edu/record=b1231145~S1*cat
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
DR2003-08SEIOProximalPoint.pdf | 160,6Kb | Visualitza/Obre |