Back to my home page.

Combinatorial Optimization Algorithms for Radio Network Planning

Patrice Calégari, Frederic Guidec, Pierre Kuonen and Frank Nielsen

Abstract:
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.  
Key words: combinatorial optimization, radio transceiver siting, set system, genetic algorithm, parallel computing.  
Get the PDF paper here (1305 KB)
Or ask me the PS paper (5502 KB size, 13 pages, 8 figures) © Elsevier Science.
 
The original publication is available at Elsevier Science.
doi:10.1016/S0304-3975(00)00245-0
Bibtex entry:
@Article{cgkn-coarnp-2001,
 author = {Patrice Cal\'egari, and Fr\'ed\'eric Guidec and Pierre Kuonen and Frank Nielsen},
 title = {Combinatorial optimization algorithms for radio network planning},
 journal = {Theoretical Computer Science},
 volume = {263},
 number = {1-2},
 year = {2001},
 issn = {0304-3975},
 pages = {235--265},
 publisher = {Elsevier Science Publishers Ltd.},
 doi = {10.1016/S0304-3975(00)00245-0}
 }
Related publications:
© Copyright notice.
Last updated, 2003.