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

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

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

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.contributor	Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
dc.contributor.author	Montero Mercadé, Lídia
dc.contributor.author	Codina Sancho, Esteve
dc.contributor.author	Barceló Bugeda, Jaime
dc.date	1996
dc.identifier.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.
dc.identifier.uri	http://hdl.handle.net/2117/27603
dc.language.iso	eng
dc.relation	http://cataleg.upc.edu/record=b1124801~S1*cat
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
dc.subject	Traffic Equilibria
dc.subject	Restricted Simplicial Decomposition
dc.subject	Variational Inequalities
dc.subject	Projection Methods
dc.subject	Quadratic Programming
dc.subject	Classificació AMS::90 Operations research, mathematical programming
dc.title	A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI
dc.type	info:eu-repo/semantics/draft
dc.type	info:eu-repo/semantics/report
dc.description.abstract	Draft pel 4th Meeting del Euro Working Group on Transportation (Newcastle 9-11 setembre de 1.996)
dc.description.abstract	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.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author