Formulations for designing robust networks. An application to wind power collection

Abstract : We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E ⊂ E, covering T and r, such that the network induced by E is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set, a flow and a bi-level formulation where the second-level is a min-max problem (with an attacker and a defender). We propose algorithms for each problem formulation and compare their efficiency.
Type de document :
Article dans une revue
Electronic Notes in Discrete Mathematics, 2018, Inernational network optimization conference 2017., 64, pp.365-374. 〈10.1016/j.endm.2018.02.011〉
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01465398
Contributeur : Marie-Christine Costa <>
Soumis le : mercredi 13 juin 2018 - 17:09:50
Dernière modification le : mardi 13 novembre 2018 - 17:10:03
Document(s) archivé(s) le : vendredi 14 septembre 2018 - 15:18:56

Fichiers

INOC2017Revise.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont. Formulations for designing robust networks. An application to wind power collection. Electronic Notes in Discrete Mathematics, 2018, Inernational network optimization conference 2017., 64, pp.365-374. 〈10.1016/j.endm.2018.02.011〉. 〈hal-01465398〉

Partager

Métriques

Consultations de la notice

31

Téléchargements de fichiers

23