Models for the piecewise linear unsplittable multicommodity flow problems - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue European Journal of Operational Research Année : 2017

Models for the piecewise linear unsplittable multicommodity flow problems

Résumé

In this paper, we consider multicommodity flow problems, with unsplit-table flows and piecewise linear routing costs. We first focus on the case where the piecewise linear routing costs are convex. We show that this problem is N P-hard for the general case, but polynomially solvable when there is only one commodity. We then propose a strengthened mixed-integer programming formulation for the problem. We show that the linear relaxation of this formulation always gives the optimal solution of the problem for the single commodity case. We present a wide array of computational experiments, showing this formulation also produces very tight linear programming bounds for the multi-commodity case. Finally, we also adapt our formulation for the non-convex case. Our experimental results imply that the linear programming bounds for this case, are only slightly than the ones of state-of-the-art models for the splittable flow version of the problem.
Fichier principal
Vignette du fichier
PUMF.pdf (448.24 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01665610 , version 1 (21-12-2017)

Identifiants

Citer

Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz. Models for the piecewise linear unsplittable multicommodity flow problems. European Journal of Operational Research, 2017, 261 (1), pp.30 - 42. ⟨10.1016/j.ejor.2017.01.051⟩. ⟨hal-01665610⟩
200 Consultations
592 Téléchargements

Altmetric

Partager

More