http://www.cnr.it/ontology/cnr/individuo/prodotto/ID288442
A convergent and efficient decomposition method for the traffic assignment problem (Articolo in rivista)
- Type
- Label
- A convergent and efficient decomposition method for the traffic assignment problem (Articolo in rivista) (literal)
- Anno
- 2014-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1007/s10589-014-9668-6 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Di Lorenzo D.; Galligari A.; Sciandrone M. (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
- http://www.scopus.com/inward/record.url?eid=2-s2.0-84902037797&partnerID=q2rCbXpz (literal)
- Rivista
- Note
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- Dipartimento di Ingegneria dell'Informazione, Università di Firenze, Italy; Istituto di Analisi dei Sistemi ed Informatica \"Antonio Ruberti\", CNR, Roma, Italy (literal)
- Titolo
- A convergent and efficient decomposition method for the traffic assignment problem (literal)
- Abstract
- In this work we consider the network equilibrium problem formulated as convex minimization problem whose variables are the path flows. In order to take into account the difficulties related to the large dimension of real network problems we adopt a decomposition-based approach suitably combined with a column generation strategy. We present an inexact block-coordinate descent method and we prove the global convergence of the algorithm. The results of computational experiments performed on medium-large dimensional problems show that the proposed algorithm is at least competitive with state of the art algorithms. © 2014 Springer Science+Business Media New York. (literal)
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Prodotto
- Autore CNR di
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Insieme di parole chiave di
