To access the full text documents, please follow this link: http://hdl.handle.net/2117/27603

A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI
Montero Mercadé, Lídia; Codina Sancho, Esteve; Barceló Bugeda, Jaime
Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa; Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
Draft pel 4th Meeting del Euro Working Group on Transportation (Newcastle 9-11 setembre de 1.996)
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, separable, problems named RSDTA. Both computer codes are compared for large scale separable traffic assignment problems. Some meaningful figures are shown for general problems with several levels of asymmetry.
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
Traffic Equilibria
Restricted Simplicial Decomposition
Variational Inequalities
Projection Methods
Quadratic Programming
Classificació AMS::90 Operations research, mathematical programming
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Article - Draft
Report
         

Show full item record

Related documents

Other documents of the same author

Montero Mercadé, Lídia; Codina Sancho, Esteve; Barceló Bugeda, Jaime
Montero Mercadé, Lídia; Codina Sancho, Esteve; Barceló Bugeda, Jaime
Codina Sancho, Esteve; Ibáñez Marí, Gemma; Barceló Bugeda, Jaime
 

Coordination

 

Supporters