A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem

In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations for base station transmitters in order to get a maximum coverage area with a minimum number of transmitters. Because of the very high amount of possible solutions, this problem is suitable to be tackled with evolutionary techniques, so in our work it has been developed an algorithm inspired on the well-known Differential Evolution algorithm, obtaining good results.

[1]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[2]  Gilles Fedak,et al.  The Computational and Storage Potential of Volunteer Computing , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[3]  E. Alba,et al.  Evolutionary algorithms for optimal placement of antennae in radio network design , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[4]  Sami Khuri,et al.  Heuristic algorithms for the terminal assignment problem , 1997, SAC '97.

[5]  Pierre Kuonen,et al.  Parallel Island-Based Genetic Algorithm for Radio Network Design , 1997, J. Parallel Distributed Comput..

[6]  Hussein A. Abbass,et al.  The Pareto Differential Evolution Algorithm , 2002, Int. J. Artif. Intell. Tools.

[7]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.