Article ID: | iaor20165039 |
Volume: | 69 |
Issue: | 1 |
Start Page Number: | 6 |
End Page Number: | 22 |
Publication Date: | Jan 2017 |
Journal: | Networks |
Authors: | Carello Giuliana, Mattia Sara, Addis Bernardetta |
Keywords: | communications, engineering, simulation, transportation: road, combinatorial optimization, vehicle routing & scheduling |
This article focuses on the problem of minimizing the energy consumption in a resilient telecommunications network. For each demand, an edge‐disjoint pair of paths (primary and backup) must be provided and the shared protection scheme is used. The energy consumption is due only to edges used in the no‐fault scenario, but both primary and backup paths contribute to capacity consumption. We propose a projected formulation for the problem and show its effectiveness by comparing it with the complete formulation. We propose valid inequalities for both formulations. We evaluate the performances of the proposed formulations and valid inequalities through computational tests. Furthermore, we investigate the relationship between the shared and the dedicated protection version of the problem.