A Subspace Search-Based Evolutionary Algorithm for Large-Scale Constrained Multiobjective Optimization and Application

Large-scale constrained multiobjective optimization problems (LSCMOPs) exist widely in science and technology. LSCMOPs pose great challenges to algorithms due to the need to optimize multiple conflicting objectives and satisfy multiple constraints in a large search space. To better address such problems, this article proposes a dynamic subspace search-based evolutionary algorithm for solving LSCMOPs. The main idea is to initially allow the population to search in a low-dimensional subspace to increase convergence, then the searched subspace is gradually expanded to encourage the population to further search the full decision space. Specifically, the contribution of each decision variable to the evolution is first calculated using the proposed decision variable analysis method. Then, a probability-based offspring generation strategy is developed to encourage the population to preferentially search in a low-dimensional subspace composed of decision variables with high contribution degrees, thus speeding up the early convergence. With the continuous progress of evolution, the subspace is gradually expanded to ensure that the population can better explore the entire space. The performance of the proposed algorithm is evaluated on a variety of test problems with 100–1000 decision variables. Experimental results on four test suits and three real-world instances show that the proposed algorithm is efficient in solving LSCMOPs.