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...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 263; no. 1; pp. 235 - 245
Main Authors Calégari, Patrice, Guidec, Frédéric, Kuonen, Pierre, Nielsen, Frank
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 2001
Elsevier
Subjects
Applied sciences
Calculus of variations and optimal control
Combinatorial optimization
Exact sciences and technology
Flows in networks. Combinatorial problems
Genetic algorithm
Mathematical analysis
Mathematical programming
Mathematics
Operational research and scientific management
Operational research. Management science
Parallel computing
Radio transceiver siting
Sciences and techniques of general use
Set system
Parallel computing
Combinatorial optimization
Genetic algorithm
Set system
Radio transceiver siting
Parallel computation
Radio transmission
Planning
Communication network
Online AccessGet full text

Cover

More Information
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