Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints
暂无分享,去创建一个
In this paper, we consider the problem of designing a minimum cost communication network subject to certain two-connected survivability constraints. This problem was motivated by work at Bellcore on planning fiber optic communications networks. We introduce heuristics for constructing initial feasible networks, and local improvement heuristics for reducing the cost of existing network designs while preserving a feasible network. This approach is shown to be effective on data from both real-world fiber optic communications network problems and randomly generated problems.
[1] K. Steiglitz,et al. The Design of Minimum-Cost Survivable Networks , 1969 .
[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[3] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[4] Clyde L. Monma,et al. Minimum-weight two-connected spanning networks , 1990, Math. Program..
[5] Martin Grötschel,et al. Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..