Repository logo
 
Publication

Benchmarking a Wide Spectrum of Metaheuristic Techniques for the Radio Network Design Problem

2009-08Journal article Open access
Simple item page
dc.contributor.authorMendes, S.P.
dc.contributor.authorMolina, G.
dc.contributor.authorVega-Rodriguez, M.A.
dc.contributor.authorGomez-Pulido, J.A.
dc.contributor.authorSaez, Y.
dc.contributor.authorMiranda, G.
dc.contributor.authorSegura, C.
dc.contributor.authorAlba, E.
dc.contributor.authorIsasi, P.
dc.contributor.authorLeon, C.
dc.contributor.authorSanchez-Perez, J.M.
dc.contributor.authorMendes, Silvio
dc.date.accessioned2025-05-05T15:33:48Z
dc.date.available2025-05-05T15:33:48Z
dc.date.issued2009-08
dc.description.abstractThe radio network design (RND) is an NP-hard optimization problem which consists of the maximization of the coverage of a given area while minimizing the base station deployment. Solving RND problems efficiently is relevant to many fields of application and has a direct impact in the engineering, telecommunication, scientific, and industrial areas. Numerous works can be found in the literature dealing with the RND problem, although they all suffer from the same shortfall: a noncomparable efficiency. Therefore, the aim of this paper is twofold: first, to offer a reliable RND comparison base reference in order to cover a wide algorithmic spectrum, and, second, to offer a comprehensible insight into accurate comparisons of efficiency, reliability, and swiftness of the different techniques applied to solve the RND problem. In order to achieve the first aim we propose a canonical RND problem formulation driven by two main directives: technology independence and a normalized comparison criterion. Following this, we have included an exhaustive behavior comparison between 14 different techniques. Finally, this paper indicates algorithmic trends and different patterns that can be observed through this analysis.eng
dc.identifier.citationS. P. Mendes et al., "Benchmarking a Wide Spectrum of Metaheuristic Techniques for the Radio Network Design Problem," in IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 1133-1150, Oct. 2009, doi: 10.1109/TEVC.2009.2023448.
dc.identifier.doi10.1109/tevc.2009.2023448
dc.identifier.eissn1941-0026
dc.identifier.issn1089-778X
dc.identifier.urihttp://hdl.handle.net/10400.8/12850
dc.language.isoeng
dc.peerreviewedyes
dc.publisherInstitute of Electrical and Electronics Engineers
dc.relation.hasversionhttps://ieeexplore.ieee.org/document/5200350
dc.relation.ispartofIEEE Transactions on Evolutionary Computation
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectAntennae
dc.subjectbenchmarking
dc.subjectevolutionary algorithms
dc.subjectmetaheuristics
dc.subjectoptimization
dc.subjectradio network design (RND)
dc.titleBenchmarking a Wide Spectrum of Metaheuristic Techniques for the Radio Network Design Problemeng
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage1150
oaire.citation.issue5
oaire.citation.startPage1133
oaire.citation.titleIEEE Transactions on Evolutionary Computation
oaire.citation.volume13
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameMendes
person.givenNameSilvio
person.identifier.ciencia-id1513-13E9-C8A6
person.identifier.orcid0000-0002-1667-5745
relation.isAuthorOfPublicatione23cc83a-4e70-4088-a73d-075808bda28f
relation.isAuthorOfPublication.latestForDiscoverye23cc83a-4e70-4088-a73d-075808bda28f

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem.pdf
Size:
563.43 KB
Format:
Adobe Portable Document Format
Description:
The radio network design (RND) is an NP-hard optimization problem which consists of the maximization of the coverage of a given area while minimizing the base station deployment. Solving RND problems efficiently is relevant to many fields of application and has a direct impact in the engineering, telecommunication, scientific, and industrial areas. Numerous works can be found in the literature dealing with the RND problem, although they all suffer from the same shortfall: a noncomparable efficiency. Therefore, the aim of this paper is twofold: first, to offer a reliable RND comparison base reference in order to cover a wide algorithmic spectrum, and, second, to offer a comprehensible insight into accurate comparisons of efficiency, reliability, and swiftness of the different techniques applied to solve the RND problem. In order to achieve the first aim we propose a canonical RND problem formulation driven by two main directives: technology independence and a normalized comparison criterion. Following this, we have included an exhaustive behavior comparison between 14 different techniques. Finally, this paper indicates algorithmic trends and different patterns that can be observed through this analysis.
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.32 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

ESTG - Artigos em revistas internacionais