Combinatorial optimization algorithms for radio network planning

DOI10.1016/S0304-3975(00)00245-0MaRDI QIDQ5941516zbMATH OpenFDO

Authors P. Calégari, F. Guidec, P. Kuonen, Frank Nielsen

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00245-0

zbMATH Keywords

combinatorial optimizationgenetic algorithmparallel computingradio transceiver sitingset system

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Review text

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 \(\varepsilon\)-nets.

Recommendations

• Heuristic algorithms for the optimisation of telecommunication networks
• Combinatorial optimization problems in wireless switch design
• Optimal Placement of Antennae Using Metaheuristics
• Automatic radio planning of GSM cellular networks
• scientific article; zbMATH DE number 2050768

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• A Tight Analysis of the Greedy Algorithm for Set Cover
• Almost optimal set covers in finite VC-dimension
• Almost tight bounds for -nets
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• scientific article; zbMATH DE number 1559541 (Why is no real title available?)
• Improved performance of the greedy algorithm for partial cover
• New trends in discrete and computational geometry
• Reducibility among combinatorial problems

Cited in

(7)

• Local search algorithms for the radio link frequency assignment problem
• A rolling window optimization method for large-scale WCDMA base stations planning problem
• scientific article; zbMATH DE number 5014521 (Why is no real title available?)
• scientific article; zbMATH DE number 2040676 (Why is no real title available?)
• scientific article; zbMATH DE number 871926 (Why is no real title available?)
• Optimal Placement of Antennae Using Metaheuristics
• A Benders decomposition algorithm for base station planning problem in WCDMA networks

This page was built for publication: Combinatorial optimization algorithms for radio network planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941516)