Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
69.074 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament d'Estadística i Investigació Operativa
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament d'Estadística i Investigació Operativa
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
DR96-05 PETRI.pdf (261,5Kb)
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/27603

Show full item record
Montero Mercadé, LídiaMés informacióMés informacióMés informació
Codina Sancho, EsteveMés informacióMés informacióMés informació
Barceló Bugeda, JaimeMés informacióMés informacióMés informació
Document typeResearch report
Defense date1996
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
This work is protected by the corresponding intellectual and industrial property rights. Except where otherwise noted, its contents are licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
Description
Draft pel 4th Meeting del Euro Working Group on Transportation (Newcastle 9-11 setembre de 1.996)
CitationMontero, L.; Codina, E.; Barcelo, J. "A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI". 1996. 
URIhttp://hdl.handle.net/2117/27603
URL other repositoryhttp://cataleg.upc.edu/record=b1124801~S1*cat
Collections
  • Departament d'Estadística i Investigació Operativa - Reports de recerca [92]
  • PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació - Reports de recerca [13]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
DR96-05 PETRI.pdf261,5KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina