Heuristic algorithms for solving survivability problem in the design of last mile communication networks

Authors:
Vo Khanh Trung;Nguyen Thi Minh;Huynh Thi Thanh Binh
Affiliations:
Ha noi University of Science and Technology, Vietnam;Ha noi University of Science and Technology, Vietnam;Ha noi University of Science and Technology, Vietnam
Venue:
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Year:
2012

Citing 7
Cited 0

Strong lower bounds for the prize collecting Steiner problem in graphs

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Design of Survivable Networks: A survey

Networks
Variations of the prize-collecting Steiner tree problem

Networks
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs

Discrete Applied Mathematics
Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks: A Presentation of Various Heuristic, Meta-Heuristic and Hybrid Approaches and Experimental Results

Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks: A Presentation of Various Heuristic, Meta-Heuristic and Hybrid Approaches and Experimental Results
Reduction tests for the prize-collecting Steiner problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a connected, weighted, undirected graph G = (V, E), a set infrastructure nodes and a set customers C includes two customer types where by customers C1 require a single connection (type-1) and customers C2 need to be redundantly connected (type-2). Survivable Network Design Problem (SNDP) seeks sub-graph of G with smallest weight in which all customers are connected to infrastructure nodes. This problem is NP-hard and has application in the design of the last mile of the real-world communication networks. This paper proposes a new heuristic algorithm for solving SNDP. Results of computational experiments are reported to show the efficiency of proposed algorithm.