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.

A convergent and efficient decomposition method for the traffic assignment problem / Galligari, Alessandro; David, Di Lorenzo; Sciandrone, Marco. - In: COMPUTATIONAL OPTIMIZATION AND APPLICATIONS. - ISSN 1573-2894. - ELETTRONICO. - 60:(2014), pp. 0-0. [10.1007/s10589-014-9668-6]

A convergent and efficient decomposition method for the traffic assignment problem.

SCIANDRONE, MARCO
2014

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
60
0
0
Galligari, Alessandro; David, Di Lorenzo; Sciandrone, Marco
File in questo prodotto:
File Dimensione Formato  
coap15equil.pdf

Accesso chiuso

Descrizione: Articolo completo
Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 209.42 kB
Formato Adobe PDF
209.42 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1017614
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 11
social impact