Genetic and local search algorithms applied to balanced communication networks

  • Authors:
  • Eugénia Moreira Bernardino;Anabela Moreira Bernardino;Juan M. Sánchez-Pérez;Juan A. Gómez-Pulido;Miguel A. Vega-Rodríguez

  • Affiliations:
  • Polytechnic Institute of Leiria, Leiria, Portugal;Polytechnic Institute of Leiria, Leiria, Portugal;University of Extremadura, Cáceres, Spain;University of Extremadura, Cáceres, Spain;University of Extremadura, Cáceres, Spain

  • Venue:
  • Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we describe the application of different heuristics to optimise large communication networks. We use Iterated Local Search (ILS), Tabu Search (TS), Simulated Annealing (SA) and Genetic Algorithm (GA) to minimise the link cost to form balanced communication networks. This paper makes a comparison among the effectiveness of ILS, TS, SA and GA on solving large communication networks. Simulation results verify the effectiveness of these algorithms.