A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI
Document typeResearch report
Rights accessOpen Access
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
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.
URL other repositoryhttp://cataleg.upc.edu/record=b1124801~S1*cat