论文信息 - Capacitated m Ring Star Problem under Diameter Constrained Reliability

Capacitated m Ring Star Problem under Diameter Constrained Reliability

Abstract We add random link failures into a celebrated robust network design problem, called Capacitated m-Ring Star Problem (CmRSP), where m rings should connect terminal nodes to a source node at minimum cost. The result is a novel NP -Hard network optimization problem, called Capacitated m-Ring Star Problem Diameter Constrained Reliability, or CmRSP-DCR for short. The hardness of the CmRSP-DCR is formally proved. Then, we heuristically address a GRASP resolution, discuss results and trends for future work.

[1] Mauro Dell'Amico,et al. The Capacitated m-Ring-Star Problem , 2007, Oper. Res..

[2] A. Rosenthal. Computing the Reliability of Complex Networks , 1977 .

[3] Héctor Cancela,et al. Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network , 2011, IEEE Transactions on Reliability.

[4] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[5] Ramesh Bhandari,et al. Optimal physical diversity algorithms and survivable networks , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[6] Franco Robledo Amoza. GRASP heuristics for Wide Area Network design , 2005 .

[7] Clyde L. Monma,et al. Minimum-weight two-connected spanning networks , 1990, Math. Program..

[8] Héctor Cancela,et al. Reliability of communication networks with delay constraints: computational complexity and complete topologies , 2004, Int. J. Math. Math. Sci..