Repository logo
 
Publication

A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem

2009-06Book part Open access
Simple item page
datacite.subject.fosCiências Naturais::Matemáticas
datacite.subject.fosCiências Naturais::Ciências da Computação e da Informação
dc.contributor.authorBernardino, Eugénia
dc.contributor.authorBernardino, Anabela
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-06-03T10:55:31Z
dc.date.available2025-06-03T10:55:31Z
dc.date.issued2009-06
dc.description10th International Work-Conference on Artificial Neural Networks, IWANN 2009, 10 June 2009 through 12 June 2009 - Code 77015
dc.description.abstractThe field of communication networks has witnessed tremendous growth in recent years resulting in a large variety of combinatorial optimization problems in the design and in the management of communication networks. One of these problems is the terminal assignment problem. The task here is to assign a given set of terminals to a given set of concentrators. In this paper, we propose a Hybrid Differential Evolution Algorithm to solve the terminal assignment problem. We compare our results with the results obtained by the classical Genetic Algorithm and the Tabu Search Algorithm, widely used in literature.eng
dc.identifier.citationBernardino, E.M., Bernardino, A.M., Sánchez-Pérez, J.M., Gómez-Pulido, J.A., Vega-Rodríguez, M.A. (2009). A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem. In: Omatu, S., et al. Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02481-8_25.
dc.identifier.doi10.1007/978-3-642-02481-8_25
dc.identifier.eissn1611-3349
dc.identifier.isbn9783642024801
dc.identifier.isbn9783642024818
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10400.8/13075
dc.language.isoeng
dc.peerreviewedyes
dc.publisherSpringer Nature
dc.relation.hasversionhttps://link.springer.com/chapter/10.1007/978-3-642-02481-8_25
dc.relation.ispartofLecture Notes in Computer Science
dc.relation.ispartofDistributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
dc.rights.uriN/A
dc.subjectCommunication Networks
dc.subjectGenetic Algorithms
dc.subjectHybrid Differential Evolution Algorithm
dc.subjectTabu Search
dc.subjectTerminal Assignment Problem
dc.titleA Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problemeng
dc.typebook part
dspace.entity.typePublication
oaire.citation.endPage186
oaire.citation.issuePART II
oaire.citation.startPage179
oaire.citation.titleLecture Notes in Computer Science
oaire.citation.volume5518
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
Thumbnail Image
Name:
A hybrid differential evolution algorithm for solving the terminal assignment problem.pdf
Size:
235.45 KB
Format:
Adobe Portable Document Format
Description:
The field of communication networks has witnessed tremendous growth in recent years resulting in a large variety of combinatorial optimization problems in the design and in the management of communication networks. One of these problems is the terminal assignment problem. The task here is to assign a given set of terminals to a given set of concentrators. In this paper, we propose a Hybrid Differential Evolution Algorithm to solve the terminal assignment problem. We compare our results with the results obtained by the classical Genetic Algorithm and the Tabu Search Algorithm, widely used in literature.
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 - Capítulos de livros