The reliability of network topologies is an important key issue for business success. This paper investigates the reliable communication network design problem using an iterated local search (ILS) method. This paper demonstrates how the concepts of local search (LS) and iterated local search can be applied to this design problem. A new neighborhood move that finds cheaper networks without violating the reliability constraint is proposed. Empirical results show that the ILS method is more efficient than a genetic algorithm.
['Dirk Reichelt', 'Peter Gmilkowsky', 'Peter Linser']
A study of an iterated local search on the reliable communication networks design problem