A study of an iterated local search on the reliable communication networks design problem

Authors:
Dirk Reichelt;Peter Gmilkowsky;Sebastian Linser
Affiliations:
Institute of Information Systems, Ilmenau Technical University, Ilmenau, Germany;Institute of Information Systems, Ilmenau Technical University, Ilmenau, Germany;Institute of Information Systems, Ilmenau Technical University, Ilmenau, Germany
Venue:
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Year:
2005

Citing 2
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Local search genetic algorithm for optimal design of reliablenetworks

IEEE Transactions on Evolutionary Computation

Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.