Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI

Autor
Lídia Montero; Codina, E.; Barcelo, J.
Tipus d'activitat
Document cientificotècnic
Data
1996
Repositori
http://hdl.handle.net/2117/27603 Obrir en finestra nova
URL
http://cataleg.upc.edu/record=b1124801~S1*cat Obrir en finestra nova
Resum
Draft pel 4th Meeting del Euro Working Group on Transportation (Newcastle 9-11 setembre de 1.996) Research Report in European Project PETRI E0261. The class of simplicial decomposition methods has shown to constitute efficient tools for the solution of the variational inequality formulation of the general traffic assignment problem. The paper presents a particular implementation of such an algorithm, called RSDVI, and a restricted simplicial decomposition algorithm, developed adhoc for diagonal...
Citació
Montero, L.; Codina, E.; Barcelo, J. "A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI". 1996.
Paraules clau
Traffic Equilibria, Restricted Simplicial Decomposition, Variational Inequalities, Projection Methods, Quadratic Programming
Grup de recerca
PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació

Participants

Arxius