In this paper, we consider the survivable network design problem for simultaneous unicast and anycast flow requests. We assume that the network is modeled by a connected and undirected graph. This problem aims at finding a set of... more
In this paper, we consider the survivable network design problem for simultaneous unicast and anycast flow requests. We assume that the network is modeled by a connected and undirected graph. This problem aims at finding a set of connections with a minimized network cost in order to protect the network against any single failure. The cost is computed using the all capacities modular cost (ACMC) model and a set of flow demands. We name it as ACMC-based survivable network design problem (ASNDP). It is proved that the problem is NP-hard. We introduce a multi-objective approach to solveA-SNDP. The objectives are to minimize the network cost (NCost) and the network failure (NFail). Extensive simulation results on instances of Polska, Germany and Atlanta networks showed the efficiency of the multi-objective approach for solving A-SNDP [2] Long Nguyen, Bui Thu Lam and Husein Abbass,(11/2014), DMEA-II: the Direction-based Multi-objective Evolutionary Algorithm –II, Soft Computing, Volume 18...
