Algorithm portfolio based scheme for dynamic optimization problems

Vista sencilla de ítem
dc.contributor.authorFajardo Calderín, Jenny
dc.contributor.authorMasegosa Arredondo, Antonio David
dc.contributor.authorPelta Mochcovsky, David Alejandro
dc.date.accessioned2026-02-13T10:41:42Z
dc.date.available2026-02-13T10:41:42Z
dc.date.issued2015-08-01
dc.date.updated2026-02-13T10:41:42Z
dc.description.abstractSince their first appearance in 1997 in the prestigious journal Science, algorithm portfolios have become a popular approach to solve static problems. Nevertheless and despite that success, they have not received much attention in Dynamic Optimization Problems (DOPs). In this work, we aim at showing these methods as a powerful tool to solve combinatorial DOPs. To this end, we propose a new algorithm portfolio for this type of problems that incorporates a learning scheme to select, among the metaheuristics that compose it, the most appropriate solver or solvers for each problem, configuration and search stage. This method was tested over 5 binary-coded problems (dynamic variants of OneMax, Plateau, RoyalRoad, Deceptive and Knapsack) and compared versus two reference algorithms for these problems (Adaptive Hill Climbing Memetic Algorithm and Self Organized Random Immigrants Genetic Algorithm). The results showed the importance of a good design of the learning scheme, the superiority of the algorithm portfolio against the isolated version of the metaheuristics that integrate it, and the competitiveness of its performance versus the reference algorithms.en
dc.description.sponsorshipThis work has been supported by the research projects TIN2011-27696-C02-01 and TEC2013-45585-C2-2-R from the Spanish Ministry of Economy and Competitiveness, P11-TIC-8001 from the Andalusian Government (including FEDER funds from the European Union), and PC2013-71A from the Basque Government. Jenny Fajardo has also been supported by a scholarship from the Ibero-American University Association for Post Graduate Studies (AUIP)en
dc.identifier.citationCalderín, J. F., Masegosa, A. D., & Pelta, D. A. (2015). Algorithm portfolio based scheme for dynamic optimization problems. International Journal of Computational Intelligence Systems, 8(4), 667-689. https://doi.org/10.1080/18756891.2015.1046327
dc.identifier.doi10.1080/18756891.2015.1046327
dc.identifier.eissn1875-6883
dc.identifier.issn1875-6891
dc.identifier.urihttps://hdl.handle.net/20.500.14454/5107
dc.language.isoeng
dc.publisherTaylor and Francis Ltd.
dc.rightsCopyright: the authors
dc.subject.otherAlgorithm portfolio
dc.subject.otherDynamic optimization problems
dc.subject.otherLearning
dc.subject.otherAlgorithm selection problem
dc.subject.otherCombinatorial problems
dc.titleAlgorithm portfolio based scheme for dynamic optimization problemsen
dc.typejournal article
dcterms.accessRightsopen access
oaire.citation.endPage689
oaire.citation.issue4
oaire.citation.startPage667
oaire.citation.titleInternational Journal of Computational Intelligence Systems
oaire.citation.volume8
oaire.licenseConditionhttps://creativecommons.org/licenses/by-nc/4.0/
oaire.versionVoR
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
fajardo_algorithm_2015.pdf
Tamaño:
362.83 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Artículos