Mostra el registre d'ítem simple
A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI
| dc.contributor.author | Montero Mercadé, Lídia |
| dc.contributor.author | Codina Sancho, Esteve |
| dc.contributor.author | Barceló Bugeda, Jaime |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa |
| dc.date.accessioned | 2015-04-27T17:48:12Z |
| dc.date.available | 2015-04-27T17:48:12Z |
| dc.date.created | 1996 |
| dc.date.issued | 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.description | 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. |
| dc.format.extent | 16 p. |
| dc.language.iso | eng |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
| dc.rights.uri | 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.other | Traffic Equilibria |
| dc.subject.other | Restricted Simplicial Decomposition |
| dc.subject.other | Variational Inequalities |
| dc.subject.other | Projection Methods |
| dc.subject.other | Quadratic Programming |
| dc.title | A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI |
| dc.type | External research report |
| dc.contributor.group | Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació |
| dc.subject.ams | Classificació AMS::90 Operations research, mathematical programming |
| dc.relation.publisherversion | http://cataleg.upc.edu/record=b1124801~S1*cat |
| dc.rights.access | Open Access |
| local.identifier.drac | 15117284 |
| dc.description.version | Preprint |
| local.citation.author | Montero, L.; Codina, E.; Barcelo, J. |
| local.citation.publicationName | A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [91]
-
Reports de recerca [13]