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

  • Authors:

  • Sílvio P. Mendes;Guillermo Molina;Miguel A. Vega-Rodríguez;Juan A. Gómez-Pulido;Yago Sáez;Gara Miranda;Carlos Segura;Enrique Alba;Pedro Isasi;Coromoto León;Juan M. Sánchez-Pérez

  • Affiliations:

  • Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal;Department of Languages and Computer Sciences, University of Malaga, Malaga, Spain;Department of Technologies of Computers and Communications, University of Extremadura, Caceres, Spain;Department of Technologies of Computers and Communications, University of Extremadura, Caceres, Spain;Department of Computer Science, Carlos III University of Madrid, Leganés, Spain;Department of Computer Science, University of La Laguna, Tenerife, Spain;Department of Computer Science, University of La Laguna, Tenerife, Spain;Department of Languages and Computer Sciences, University of Malaga, Malaga, Spain;Department of Computer Science, Carlos III University of Madrid, Leganés, Spain;Department of Computer Science, University of La Laguna, Tenerife, Spain;Department of Technologies of Computers and Communications, University of Extremadura, Caceres, Spain

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The radio network design (RND) is an NP-hard optimization problem which consists of the maximization of the coverage of a given area while minimizing the base station deployment. Solving RND problems efficiently is relevant to many fields of application and has a direct impact in the engineering, telecommunication, scientific, and industrial areas. Numerous works can be found in the literature dealing with the RND problem, although they all suffer from the same shortfall: a noncomparable efficiency. Therefore, the aim of this paper is twofold: first, to offer a reliable RND comparison base reference in order to cover a wide algorithmic spectrum, and, second, to offer a comprehensible insight into accurate comparisons of efficiency, reliability, and swiftness of the different techniques applied to solve the RND problem. In order to achieve the first aim we propose a canonical RND problem formulation driven by two main directives: technology independence and a normalized comparison criterion. Following this, we have included an exhaustive behavior comparison between 14 different techniques. Finally, this paper indicates algorithmic trends and different patterns that can be observed through this analysis.