2026-04-13T13:29:56Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/892742025-07-17T07:03:19Zcom_2072_1033col_2072_452950

urn:hdl:2117/89274 The general traffic assignment problem: a proximal point method for equilibrium computation with application to the demand adjustment problem Montero Mercadé, Lídia Codina Sancho, Esteve Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa Traffic assignment variational inequality proximal point algorithm Bilevel programming demand adjustment Classificació AMS::62 Statistics Presented at the SEIO (Sociedad Española de Estadística e Investigació Operativa) Congress 2003, Lleida 8 to 11th April. 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 Preprint 2003 External research report DR 2003/08 http://cataleg.upc.edu/record=b1231145~S1*cat http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Open Access