Learning-Aided Evolutionary Search and Selection for Scaling-Up Constrained Multiobjective Optimization
Abstract: The existing constrained multiobjective evolutionary algorithms (CMOEAs) still have great room for improvement in balancing population’s convergence, diversity and feasibility on complex constrained multiobjective optimization problems (CMOPs). Besides, their effectiveness deteriorates dramatically when facing the CMOPs with scaling-up objective space or search space. We are thus motivated to design a learning-aided CMOEA with promising problem-solving ability and scalability for various CMOPs. In the proposed solver, two learning models are, respectively, trained online on constrained-ignored task and feasibility-first task, which are then used to learn the two improvement-based vectors for enhancing the search by differential evolution. In addition, the union population of parent and child solutions is divided into multiple subsets with a hierarchical clustering based on cosine similarity. A comprehensive indicator, considering objective-based performance and constraint violation degree of a solution, is developed to select the representative solution from each cluster. The effectiveness of the proposed optimizer is verified by solving the CMOPs with various irregular Pareto fronts, the number of objectives ranging from 2 to 15, and the dimensionality of search space scaling up to 1000.
External IDs:dblp:journals/tec/LiuWLLT25
Loading