Typical structures of population algorithms for global optimization

Anatoly P. Karpenko

N.E. Bauman MSTU

We present the author's classification of structures of population algorithms for global optimization (P-algorithms). At the population level, we single out the following structural classes of these algorithms: one-level one-population algorithms; one-level multi population algorithms; two-level algorithms; three level algorithms. At the next level of the hierarchy, we distinguish one-stage (two macro-operators), two-stage (two macro-operators) and three or more stages (three or more macro-operators) algorithms. On the other hand, we subdivide Palgorithms into stationary, program-dynamic, parametric and structural-adaptive dynamic algorithms. We consider only one population algorithms.

global optimization; population algorithms; metaheuristic algorithms; algorithms inspired by nature

Back