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

february, 2018
Publication type:
International conference with proceedings
Journal:
Electronic Notes in Discrete Mathematics, vol. 64, pp. 365-374
Conference:
INOC Inernational network optimization conference (Lisbonne).
arXiv:
images/icons/icon_arxiv.png 1806.06704
Keywords :
Mixed-integer programming; Bilevel programming; Survivable networks;
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.
BibTeX:
@inproceedings{Ben-Cos-Poi-Rid-2018,
    author={Cédric Bentz and Marie-Christine Costa and Pierre-Louis 
           Poirion and Thomas Ridremont },
    title={Formulations for designing robust networks. An application to 
           wind power collection },
    doi={10.1016/j.endm.2018.02.011 },
    organization={INOC Inernational network optimization conference (Lisbonne). },
    booktitle={Electronic Notes in Discrete Mathematics },
    year={2018 },
    month={2},
    volume={64 },
    pages={365--374},
}