Combinatorial optimization algorithms for radio network planning

This paper uses a realistic problem taken from the telecommunication world as the basis for comparing different combinatorial optimization algorithms. The problem recalls the minimum hitting set problem, and is solved with greedy-like, Darwinism and genetic algorithms. These three paradigms are described and analyzed with emphasis on the Darwinism approach, which is based on the computation of e-nets.

[1]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[2]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[3]  V. Paschos.  A survey of approximately optimal solutions to some covering and packing problems , 1997, CSUR.

[4]  Rong-chii Duh,et al.  Approximation of k-set cover by semi-local optimization , 1997, STOC '97.

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[7]  Uriel Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[8]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[9]  Petr Slavík.  Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..

[10]  Jiří Matoušek,et al.  Epsilon-Nets and Computational Geometry , 1993 .

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

[12]  P. Kuonen,et al.  Genetic approach to radio network optimization for mobile systems , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[13]  János Komlós,et al.  Almost tight bounds forɛ-Nets , 1992, Discret. Comput. Geom..

[14]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[15]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.