Journal
OPTIMIZATION METHODS & SOFTWARE
Volume 34, Issue 6, Pages 1231-1250Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/10556788.2018.1484123
Keywords
Algorithm portfolios; metaheuristics; resource allocation; performance forecasting; parallel algorithms; combinatorial optimization
Categories
Funding
- RSF grant [14-41-00039]
- Shared Hierarchical Academic Research Computing Network (SHARCNET)
- WestGrid HPCconsortium
- Laboratory of Algorithms and Technologies for Network Analysis
- Russian Science Foundation [14-41-00039] Funding Source: Russian Science Foundation
Ask authors/readers for more resources
We propose a novel algorithm portfolio model that incorporates time series forecasting techniques to predict online the performance of its constituent algorithms. The predictions are used to allocate computational resources to the algorithms, accordingly. The proposed model is demonstrated on parallel algorithm portfolios consisting of three popular metaheuristics, namely tabu search, variable neighbourhood search, and multistart local search. Moving average and exponential smoothing techniques are employed for forecasting purposes. A challenging combinatorial problem, namely the detection of circulant weighing matrices, is selected as the testbed for the analysis of the proposed approach. Experimental evidence and statistical analysis provide insight on the performance of the proposed algorithms and reveal the benefits of using forecasting techniques for resource allocation in algorithm portfolios.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available