Loading...
Loading...

Go to the content (press return)

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

Author
Lídia Montero; Codina, E.; Barcelo, J.
Type of activity
Report
Date
1996
Repository
http://hdl.handle.net/2117/27603 Open in new window
URL
http://cataleg.upc.edu/record=b1124801~S1*cat Open in new window
Abstract
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...
Citation
Montero, L.; Codina, E.; Barcelo, J. "A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI". 1996.
Keywords
Projection Methods, Quadratic Programming, Restricted Simplicial Decomposition, Traffic Equilibria, Variational Inequalities
Group of research
IMP - Information Modelling and Processing
inLab FIB

Participants

Attachments