Skip navigation
Please use this identifier to cite or link to this item: http://repositorio.unb.br/handle/10482/50367
Files in This Item:
There are no files associated with this item.
Title: On the behavior of parallel island models
Authors: Silveira, Lucas Ângelo da
Lima, Thaynara Arielly de
Barros, Jessé Barreto de Barros
Soncco-Álvarez, José Luis
Llanos Quintero, Carlos Humberto
Ayala-Rincón, Mauricio
metadata.dc.identifier.orcid: https://orcid.org/0000-0002-8107-9659
https://orcid.org/0000-0002-0852-9086
https://orcid.org/0000-0001-9435-2688
https://orcid.org/0000-0002-3544-5777
https://orcid.org/0000-0002-0115-4461
metadata.dc.contributor.affiliation: Universidade de Brasília, Department of Computer Science
Universidade Federal de Goiás, Department of Mathematics
Universidade de Brasília, Department of Mechanical Engineering
Universidad Nacional de San Antonio Abad del Cusco, Department of Informatics, Peru
Universidade de Brasília, Department of Mechanical Engineering
Assunto:: Algoritmos genéticos
Modelos de ilhas paralelas
Issue Date: 2023
Publisher: Elsevier B. V.
Citation: SILVEIRA, Lucas A. de et al. On the behavior of parallel island models. Applied Soft Computing, [S. l.], v. 148, 110880, nov. 2023. DOI: https://doi.org/10.1016/j.asoc.2023.110880.
Abstract: Parallel island models (PIMs) are used to enhance the performance of evolutionary algorithms (EAs). In PIMs, each island executes an EA for evolving its local population, and periodically individuals migrate to neighborhoods synchronously or asynchronously. Neighborhoods are organized through a topology of communication, and migration policies guide individual exchange. This work explores migration policies over different communication topologies in synchronous and asynchronous PIMs to improve the speed-up and accuracy of genetic algorithms (GAs). The aim is to explain such models’ adequacy from a general perspective, attempting to answer questions such as the best way to implement GAs in PIMs. To reach this goal, the quality of the solutions and the running time provided by proposed PIMs are evaluated over four -hard problems of different combinatorial nature: reversal and translocation evolutionary distance, task mapping and scheduling, and -Queens. The experiments show that tuning the parameters of the breeding cycle and migration policies is vital to guarantee that all proposed PIMs reach good speed-ups and more accurate solutions than the sequential GA. In addition, experiments ratify that synchronous models provide the best solutions, while asynchronous models deliver the best speed-ups. Finally, the results show that no model provides either better speed-up or accuracy in general since, as for sequential models, the nature of the problem define which would be the best-adapted PIM.
metadata.dc.description.unidade: Instituto de Ciências Exatas (IE)
Departamento de Ciência da Computação (IE CIC)
Faculdade de Tecnologia (FT)
Departamento de Engenharia Mecânica (FT ENM)
metadata.dc.description.ppg: Programa de Pós-Graduação em Informática
DOI: https://doi.org/10.1016/j.asoc.2023.110880
metadata.dc.relation.publisherversion: https://www.sciencedirect.com/science/article/abs/pii/S1568494623008980?via%3Dihub
Appears in Collections:Artigos publicados em periódicos e afins

Show full item record " class="statisticsLink btn btn-primary" href="/jspui/handle/10482/50367/statistics">



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.