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 desc...
Saved in:
Published in | Theoretical computer science Vol. 263; no. 1; pp. 235 - 245 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
2001
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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
ε-nets. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0304-3975 1879-2294 |
DOI: | 10.1016/S0304-3975(00)00245-0 |