RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Industrial'noi Matematiki // Archive

Sib. Zh. Ind. Mat., 2022 Volume 25, Number 4, Pages 164–178 (Mi sjim1203)

Hierarchical method of parameter setting for population-based metaheuristic optimization algorithms

E. U. Seliverstov

Bauman Moscow State Technical University, ul. 2-ya Baumanskaya 5/1, Moscow 105005, Russia

Abstract: Metaheuristic algorithms for a global optimization problem have unbound strategy parameters that affect solution accuracy and algorithm efficiency. The task of determining optimal values of unbound parameters is called a parameter setting problem that can be solved by static parameter setting methods (performed before the algorithm run) and dynamic parameter control methods (during run). The paper introduces a novel hierarchical parameter setting method for the class of population-based metaheuristic optimization algorithms. The distinctive feature of this method is usage of the hierarchical algorithm model. The lower level represents a sequential algorithm from this class, and the upper level represents an algorithm with the island parallel model. Parameter setting is performed by the hierarchical method, which composes parameter tuning for the sequential algorithm and adaptive parameter control for the parallel algorithm. Parameter control is based on vector fitness criteria which consist of a convergence rate and a solution value. An approach for estimating the convergence rate for a multistep optimization method is proposed. Experimental results for CEC benchmark problems are presented and discussed.

Keywords: global optimization, metaheuristic algorithms, parameter setting, parameter control. .

UDC: 519.6

Received: 21.03.2022
Revised: 26.07.2022
Accepted: 29.09.2022

DOI: 10.33048/SIBJIM.2021.25.413



© Steklov Math. Inst. of RAS, 2024