A Low-complexity Decision Variables Classification Brainstorm Optimization Algorithm

Abstract

Listen

Translate article

Abstract In the complex optimization scenarios of real life, we often need to not only weigh the conflicts between multi-objectives but also face the challenges brought by large-scale decision variables. When the scale of decision variables increases sharply, the search space will expand exponentially, which makes it difficult for the algorithm to traverse the whole search space under limited resources, so that the number of local optimal solutions increases sharply. The so-called ‘dimension disaster’ appears. To effectively deal with this problem, this paper proposes a large-scale multi-objective brainstorm optimization algorithm (LMaOBSO) based on low complexity decision variable classification method and improved penalty boundary intersection strategy. The algorithm uses a low-complexity tree sorting variable classification method to divide the decision variables into converges and diversity variables quickly. At the same time, the convergent variables are optimized by the improved penalty boundary crossover strategy to solve the problems existing in large-scale optimization problems.