Flows over time problems consider finding optimal dynamic flows over a network where capacities and transit times on arcs are given. In this paper we study a mul- ticommodity flow over time problem in which no storage of flow at nodes is allowed and solutions are restricted to loopless flow-paths. We propose an exact algorithm based on a column generation approach for a path-based linear programming model and present the results of a preliminary computational study.

Grande, E., Nicosia, G., Pacifici, A., Roselli, V. (2018). An exact algorithm for a multicommodity min-cost flow over time problem. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 64(February 2018), 125-134 [10.1016/j.endm.2018.01.014].

An exact algorithm for a multicommodity min-cost flow over time problem

PACIFICI, ANDREA;
2018

Abstract

Flows over time problems consider finding optimal dynamic flows over a network where capacities and transit times on arcs are given. In this paper we study a mul- ticommodity flow over time problem in which no storage of flow at nodes is allowed and solutions are restricted to loopless flow-paths. We propose an exact algorithm based on a column generation approach for a path-based linear programming model and present the results of a preliminary computational study.
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore MAT/09 - Ricerca Operativa
English
flows over time, multicommodity flow, linear programming, column generation, exact algorithm.
Grande, E., Nicosia, G., Pacifici, A., Roselli, V. (2018). An exact algorithm for a multicommodity min-cost flow over time problem. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 64(February 2018), 125-134 [10.1016/j.endm.2018.01.014].
Grande, E; Nicosia, G; Pacifici, A; Roselli, V
Articolo su rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/185771
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact