Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The general traffic assignment problem: a proximal point method for equilibrium computation with application to the demand adjustment problem

Autor
Lídia Montero; Codina, E.
Tipus d'activitat
Document cientificotècnic
Data
2003
Codi
DR 2003/08
Repositori
http://hdl.handle.net/2117/89274 Obrir en finestra nova
URL
http://cataleg.upc.edu/record=b1231145~S1*cat Obrir en finestra nova
Resum
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 prac...
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.
Paraules clau
Traffic Assignment, Variational Inequality, Proximal Point Algorithm, Bilevel Programming, Demand Adjustment
Grup de recerca
PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació

Participants

Arxius