Advanced solution methods in structural optimization based on evolution strategies

Abstract

The objective of this paper is to investigate the efficiency of hybrid solution methods when incorporated into large‐scale optimization problems solved by evolution strategies (ESs) and to demonstrate their influence on the overall performance of these optimization algorithms. ESs imitate biological evolution and combine the concept of artificial survival of the fittest with evolutionary operators to form a robust search mechanism. In this paper modified multi‐membered evolution strategies with discrete variables are adopted. Two solution methods are implemented based on the preconditioned conjugate gradient (PCG) algorithm. The first method is a PCG algorithm with a preconditioner resulted from a complete Cholesky factorization, and the second is a PCG algorithm in which a truncated Neumann series expansion is used as a preconditioner. The numerical tests presented demonstrate the computational advantages of the proposed methods, which become more pronounced in large‐scale optimization problems and in a parallel computing environment.