International Journal of Computational Intelligence Systems

Volume 8, Issue 4, August 2015, Pages 667 - 689

Algorithm portfolio based scheme for dynamic optimization problems

Authors
Jenny Fajardo Calderín, Antonio D. Masegosa, David A. Pelta
Corresponding Author
Jenny Fajardo Calderín
Received 18 December 2014, Accepted 4 March 2015, Available Online 1 August 2015.
DOI
https://doi.org/10.1080/18756891.2015.1046327How to use a DOI?
Keywords
algorithm portfolio, dynamic optimization problems, learning, algorithm selection problem, combinatorial problems
Abstract

Since 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.

Copyright
© 2017, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Journal
International Journal of Computational Intelligence Systems
Volume-Issue
8 - 4
Pages
667 - 689
Publication Date
2015/08/01
ISSN (Online)
1875-6883
ISSN (Print)
1875-6891
DOI
https://doi.org/10.1080/18756891.2015.1046327How to use a DOI?
Copyright
© 2017, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - JOUR
AU  - Jenny Fajardo Calderín
AU  - Antonio D. Masegosa
AU  - David A. Pelta
PY  - 2015
DA  - 2015/08/01
TI  - Algorithm portfolio based scheme for dynamic optimization problems
JO  - International Journal of Computational Intelligence Systems
SP  - 667
EP  - 689
VL  - 8
IS  - 4
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2015.1046327
DO  - https://doi.org/10.1080/18756891.2015.1046327
ID  - Calderín2015
ER  -