Computationally expensive constrained problems via surrogate-assisted dynamic population evolutionary optimization

Abstract

Abstract This paper proposes a surrogate-assisted dynamic population optimization algorithm (SDPOA) for the purpose of solving computationally expensive constrained optimization problems, in which the population is dynamically updated based on the real-time iteration information to achieve targeted searches for solutions with different qualities. Specifically, the population is dynamically constructed by simultaneously considering the real-time feasibility, convergence, and diversity information of all the previously evaluated solutions. The evolution strategies adapted to dynamic populations are designed to arrange targeted search resources for individuals with different potentials. Specifically, for mutation, targeted base solution selection for the top 2 and other center points is designed for emphasizing the exploitation in promising regions; for selection, the search sources arranged on the best and other population individuals are adaptively adjusted with the iteration progresses; for constraint handling, the diversity of infeasible solutions is integrated into the original constraint-domination principle to avoid the locality of only using constraint violation to rank infeasible solutions. For accelerating the convergence, the sparse local search is designed based on update state of the current best solution in which two excellent but non adjacent individuals are used to provide valuable guidance information for local search. Therefore, SDPOA strikes a balance between feasibility, diversity, and convergence. Empirical studies demonstrate that the SDPOA achieves the best performance among all the compared state-of-the-art algorithms, and the SDPOA can obtain new structures with smaller compliance in the design of polyline-based core sandwich structures.