Abstract
Algorithm portfolios are multi-algorithmic schemes that combine a number of solvers into a joint framework for solving global optimization problems. A crucial part of such schemes is the resource allocation process that is responsible for assigning computational resources to the constituent algorithms. We propose a resource allocation process based on adaptive decision-making procedures. The proposed approach is incorporated in algorithm portfolios composed of three essential types of numerical optimization algorithms, namely gradient-based, direct search, and swarm intelligence algorithms. The designed algorithm portfolios are experimentally demonstrated on a challenging optimization problem for different dimensions and experimental settings. The accompanying statistical analysis offers interesting conclusions and insights on the performance of the algorithm portfolio compared to its constituent algorithms, as well as on the effect of its parameters.
View more >>