Repository logo
 
Publication

Multiobjective frequency assignment problem using the MO-VNS and MO-SVNS algorithms

2009-12Conference paper Restricted access
Simple item page
dc.contributor.authorMaximiano, Marisa
dc.contributor.authorVega-Rodriguez, Miguel A.
dc.contributor.authorGomez-Pulido, Juan A.
dc.contributor.authorSanchez-Perez, Juan M.
dc.date.accessioned2025-06-06T09:19:49Z
dc.date.available2025-06-06T09:19:49Z
dc.date.issued2009-12
dc.descriptionArticle number 5393695 - 2009 World Congress on Nature and Biologically Inspired Computing, NABIC 2009, 9 December 2009 through 11 December 2009 - Code 79534
dc.description.abstractIn GSM networks, the Frequency Assignment is a critical task for the mobile operators. In this paper we study different multiobjective metaheuristics to address the Frequency Assignment problem (FAP). In fact, solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. This is the scenario in the FAP, where it is sought an assignment of frequencies to a number of transmitters in as efficient way as possible. The multiobjective FAP tries to minimize the number of interferences caused when a limited number of frequencies needs to be assigned to a high number of transceivers. Besides these interferences costs, the separation costs are also considered. Our approach uses a Multiobjective Variable Neighborhood Search (MO-VNS) algorithm and also its variant Multiobjective Skewed Variable Neighborhood Search (MO-SVNS). Two real-world GSM networks were used, currently being in operation, to test the presented metaheuristics.eng
dc.description.sponsorshipThis work was partially funded by the Spanish Ministry of Science and Innovation and FEDER under the contract TIN2008-06491-C04-04 (the M* project). Thanks also to the Polytechnic Institute of Leiria, for the economic support offered to Marisa Maximiano to make this research.
dc.identifier.citationM. d. S. Maximiano, M. A. Vega-Rodríguez, J. A. Gómez-Pulido and J. M. Sánchez-Pérez, "Multiobjective frequency assignment problem using the MO-VNS and MO-SVNS algorithms," 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), Coimbatore, India, 2009, pp. 221-226, doi: https://doi.org/10.1109/NABIC.2009.5393695.
dc.identifier.doi10.1109/nabic.2009.5393695
dc.identifier.isbn978-1-4244-5053-4
dc.identifier.urihttp://hdl.handle.net/10400.8/13147
dc.language.isoeng
dc.peerreviewedyes
dc.publisherIEEE Canada
dc.relationTIN2008-06491-C04-04
dc.relation.hasversionhttps://ieeexplore.ieee.org/document/5393695
dc.relation.ispartof2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)
dc.rights.uriN/A
dc.subjectMultiobjective optimization
dc.subjectVNS
dc.subjectSVNS
dc.subjectFAP
dc.subjectreal-world GSM network
dc.titleMultiobjective frequency assignment problem using the MO-VNS and MO-SVNS algorithmseng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2009-12
oaire.citation.conferencePlaceCoimbatore, India
oaire.citation.endPage226
oaire.citation.startPage221
oaire.citation.titleWorld Congress on Nature & Biologically Inspired Computing (NaBIC)
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameMaximiano
person.givenNameMarisa
person.identifier.ciencia-idA919-B117-A16D
person.identifier.orcid0000-0002-1212-7864
person.identifier.scopus-author-id26767664900
relation.isAuthorOfPublication18092229-fa61-402b-978c-56b8127d46e9
relation.isAuthorOfPublication.latestForDiscovery18092229-fa61-402b-978c-56b8127d46e9

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Multiobjective frequency assignment problem using the MO-VNS and MO-SVNS algorithms.pdf
Size:
296.21 KB
Format:
Adobe Portable Document Format
Description:
In GSM networks, the Frequency Assignment is a critical task for the mobile operators. In this paper we study different multiobjective metaheuristics to address the Frequency Assignment problem (FAP). In fact, solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. This is the scenario in the FAP, where it is sought an assignment of frequencies to a number of transmitters in as efficient way as possible. The multiobjective FAP tries to minimize the number of interferences caused when a limited number of frequencies needs to be assigned to a high number of transceivers. Besides these interferences costs, the separation costs are also considered. Our approach uses a Multiobjective Variable Neighborhood Search (MO-VNS) algorithm and also its variant Multiobjective Skewed Variable Neighborhood Search (MO-SVNS). Two real-world GSM networks were used, currently being in operation, to test the presented metaheuristics.
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 - Comunicações em conferências e congressos internacionais