Evaluation of different metaheuristics solving the RND problem

Vega-Rodriguez M. A., Gomez-Pulido J. A., Alba E., Vega-Perez D., Priem-Mendes S., Molina G.

EvoWorkshops 2007, Valencia, Spain, 11 - 13 April 2007, vol.4448, pp.101-103 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 4448
  • City: Valencia
  • Country: Spain
  • Page Numbers: pp.101-103
  • Istanbul Technical University Affiliated: No


RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest cover rate. This is an important problem, for example, in mobile/cellular technology. RND can be solved by bio-inspired algorithms. In this work we use different metaheuristics to tackle this problem. PBIL (Population-Based Incremental Learning), based on genetic algorithms and competitive learning (typical in neural networks), is a population evolution model based on probabilistic models. DE (Differential Evolution) is a very simple population-based stochastic function minimizer used in a wide range of optimization problems, including multi-objective optimization. SA (Simulated Annealing) is a classic trajectory descent optimization technique. CHC is a particular class of evolutionary algorithm which does not use mutation and relies instead on incest prevention and disruptive crossover. Due to the complexity of such a large analysis including so many techniques, we have used not only sequential algorithms, but grid computing with BOINC in order to execute thousands of experiments in only several days using around 100 computers. In this paper we present the most interesting results from our work, indicating the pros and cons of the studied solvers.