Repository logo
 
Publication

A Hybrid Scatter Search algorithm to assign terminals to concentrators

2010-07Conference paper Restricted access
Simple item page
datacite.subject.fosCiências Naturais::Ciências da Computação e da Informação
datacite.subject.fosCiências Naturais::Matemáticas
datacite.subject.sdg08:Trabalho Digno e Crescimento Económico
datacite.subject.sdg09:Indústria, Inovação e Infraestruturas
datacite.subject.sdg10:Reduzir as Desigualdades
dc.contributor.authorBernardino, Eugénia Moreira
dc.contributor.authorBernardino, Anabela Moreira
dc.contributor.authorSánchez-Pérez, Juan Manuel
dc.contributor.authorGómez-Pulido, Juan Antonio
dc.contributor.authorVega-Rodríguez, Miguel Angel
dc.date.accessioned2025-11-28T17:05:22Z
dc.date.available2025-11-28T17:05:22Z
dc.date.issued2010-07
dc.descriptionEISBN - 978-1-4244-6911-6
dc.descriptionArticle number - 5586146; Conference name - 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010; Conference date - 18 July 2010 - 23 July 2010 Conference code - 85187
dc.description.abstractThe last few years have seen a significant growth in communication networks. With the growth of data traffic, network operators seek network-engineering tools to extract the maximum benefits out of the existing infrastructure. This has suggested a number of new optimisation problems, most of them in the field of combinatorial optimisation. We address here the Terminal Assignment problem. The main objective is to assign a collection of terminals to a collection of concentrators. In this paper, we propose a Hybrid Scatter Search (HSS) algorithm to assign terminals to concentrators. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.eng
dc.description.sponsorshipThis work has been partially supported by Polytechnic Institute of Leiria (Portugal) and the MSTAR project reference: TIN2008-06491-C04-04/TIN (MICINN Spain).
dc.identifier.citationE. M. Bernardino, A. M. Bernardino, J. M. Sánchez-Pérez, J. A. Gómez-Pulido and M. A. Vega-Rodríguez, "A Hybrid Scatter Search algorithm to assign terminals to concentrators," IEEE Congress on Evolutionary Computation, Barcelona, Spain, 2010, pp. 1-8, doi: https://doi.org/10.1109/CEC.2010.5586146.
dc.identifier.doi10.1109/cec.2010.5586146
dc.identifier.isbn978-1-4244-6909-3
dc.identifier.isbn978-1-4244-6911-6
dc.identifier.urihttp://hdl.handle.net/10400.8/14797
dc.language.isoeng
dc.peerreviewedyes
dc.publisherIEEE Canada
dc.relation.hasversionhttps://ieeexplore.ieee.org/document/5586146
dc.relation.ispartofIEEE Congress on Evolutionary Computation
dc.rights.uriN/A
dc.subjectOptimization
dc.subjectComputers
dc.subjectAlgorithm design and analysis
dc.subjectArtificial neural networks
dc.subjectCommunication networks
dc.subjectClassification algorithms
dc.subjectApproximation algorithms
dc.titleA Hybrid Scatter Search algorithm to assign terminals to concentratorseng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2010-07
oaire.citation.conferencePlaceBarcelona, Spain
oaire.citation.title2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameBernardino
person.familyNameMoreira Bernardino
person.givenNameEugénia
person.givenNameAnabela
person.identifier.ciencia-id9616-F1BC-D8BD
person.identifier.ciencia-id081E-F3B8-316A
person.identifier.orcid0000-0001-5301-5853
person.identifier.orcid0000-0002-6561-5730
person.identifier.scopus-author-id24402754700
relation.isAuthorOfPublication893cf15c-eff8-4e43-949c-c1de6eb87599
relation.isAuthorOfPublication375ebe15-f84c-46a4-a3d9-6e4935a92187
relation.isAuthorOfPublication.latestForDiscovery893cf15c-eff8-4e43-949c-c1de6eb87599

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A hybrid scatter search algorithm to assign terminals to concentrators.pdf
Size:
125.62 KB
Format:
Adobe Portable Document Format
Description:
The last few years have seen a significant growth in communication networks. With the growth of data traffic, network operators seek network-engineering tools to extract the maximum benefits out of the existing infrastructure. This has suggested a number of new optimisation problems, most of them in the field of combinatorial optimisation. We address here the Terminal Assignment problem. The main objective is to assign a collection of terminals to a collection of concentrators. In this paper, we propose a Hybrid Scatter Search (HSS) algorithm to assign terminals to concentrators. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.
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

CIIC - Publicações em Atas de Conferências com Peer Review
ESTG - Comunicações em conferências e congressos internacionais