Heuristic algorithms for solving survivable network design problem with simultaneous unicast and anycast flows

Abstract

Given a connected, weighted, undirected graph G = (V, E), a set of nodes, a set of links with modular cost based on ACMC model [2] and a set of customers' demands. This paper proposes two heuristic algorithms for solving the ACMC Survivable Network Design Problem (A-SNDP). The goal is to design connections based on customers' demands with the smallest network cost to protect the network against all failures. This problem is NP-hard. The experimental results are reported to show the efficiency of proposed algorithm comparing to the Tabu Search algorithm [2]. © 2012 Springer-Verlag.