Search

In the constrained multi-objective optimization problems, the pursuit of feasibility could improve convergence but will lead to the loss of diversity. For optimization algorithm, balancing the weight between convergence and diversity dynamically is a challenge, especially in problems with low proportion of feasible regions. In this paper, a constrained multi-objective optimization algorithm is proposed based on a hybrid driven strategy to enhance both the feasibility and diversity performance of the approximate Pareto solutions. The proposed algorithm contains two archives, that one is driven by feasibility information and the other is driven by diversity information. A self-adaptive archive selection mechanism and a conditional tournament selection strategy are proposed to provide mating parent solutions according to the evolutionary stage. Moreover, in the update of the feasibility archive, an evolutionary direction prediction mechanism is proposed and adopted to improve the evolutionary efficiency. Compared to four other multi-objective algorithms on three benchmark suits of different types, the performance of the proposed algorithm is better than the peer algorithms, especially in large-infeasible-regions multi-objective optimization problems. [ABSTRACT FROM AUTHOR]

Constrained multi-objective optimization problems (CMOPs) require a delicate balance between satisfying constraints and optimizing objectives. Existing constrained multi-objective evolutionary algorithms (CMOEAs) often struggle to balance convergence, diversity, and feasibility, especially when dealing with CMOPs that have complex feasible regions. This paper proposes a multi-task-based self-organizing mapping evolutionary algorithm (MTSOM) to tackle this challenge, which includes a main and auxiliary task. Two populations independently optimize two tasks without considering constraints in the early stage. Subsequently, in the middle stage, both tasks explore the distribution structure of the population in parallel by employing a novel constraint-to-constraint self-organizing mapping (SOM) approach. In the late stage, the main task fully considers feasibility, while the auxiliary task focuses solely on the highest priority constraints. This approach enables rapid convergence toward feasible regions. To evaluate MTSOM's effectiveness, we conducted a series of experiments on five benchmark suites. Results indicate that MTSOM is competitive when compared to other state-of-the-art CMOEAs. Additionally, our proposed constraint-to-constraint SOM is superior in handling complex CMOPs. [ABSTRACT FROM AUTHOR]

Balancing multiple objectives and various constraints is crucial for effectively solving constrained multi-objective optimization problems (CMOPs). Excessive focus on either convergence or feasibility may not result in favorable outcomes of the algorithm. To confront this challenge, this paper proposes a cooperative evolutionary algorithm named SaE-CMO, which aims to achieve a harmonious balance between convergence and feasibility by extracting valuable information from both feasible and infeasible regions. To achieve this, SaE-CMO employs a dual-population approach to enhance search progress, consisting of a main population, Population1, and an auxiliary population, Population2. These two populations complement each other to achieve optimal results. A newly proposed self-adaptive epsilon method is employed in both Population1 and Population2, using different comparison criteria to select next population from mating pools, respectively. Population2 can retain some solutions that are well-constrained but poorly converged, thereby preserving information about both the constrained and the unconstrained Pareto front. This property enables Population2 to assist Population1 in maintaining diversity in certain complex CMOPs. To verify the effectiveness of SaE-CMO, we conduct experiments on three benchmark test instances and four real-world CMOPs with some related state-of-the-art constrained multi-objective optimization algorithms, experimental results prove that the proposed algorithm outperforms the compared algorithms. [ABSTRACT FROM AUTHOR]

It is of necessity to select appropriate optimization algorithms from an algorithm library due to the universality of constrained multi-objective optimization problems and the suitability of intelligent optimization algorithms, which requires a rich optimization algorithm library. This paper proposes a migration-based method of enriching the algorithm library for constrained multi-objective optimization problems. After calculating the similarity between problems based on their landscape features, the proposed method calculates the migration probabilities of intelligent optimization algorithms solving similar problems based on the performance of each algorithm and the similarity between problems. According to the redundancy and compatibility of components, the algorithms with large migration probabilities enrich the algorithm library for solving the current problem. Based on the enhanced algorithm library, a Softmax regression model is trained to generate an optimal intelligent algorithm to solve the current problem. The proposed method is applied to solve a series of constrained multi-objective optimization benchmark problems and the operation optimization problems of an integrated coal mine energy system, and the experimental results verify its effectiveness and feasibility. • A method based on landscape features is proposed to determine similar problems. • A method is given to select migrated algorithms based on similarity and performance. • A method based on redundancy and compatibility is presented to enrich an IOAL. [ABSTRACT FROM AUTHOR]

Constrained multi-objective optimization problems (CMOPs) are challenging due to the complexity of feasible regions caused by constraints, especially when facing small feasible ranges, multiple feasible regions, and complex distribution of feasible regions. Existing algorithms struggle to balance population convergence, diversity, and feasibility. This paper proposes a constrained multi-objective evolutionary algorithm framework based on global and local feasible solutions search to address this issue. The proposed framework is divided into three stages, and an adaptive method is proposed to decide when to switch the search state. In the first two stages, the evolution of the population is relatively free and not subject to constraint restrictions. Feasible solutions in the population are saved in the FeasiblePool for environmental selection during these two stages. The FeasiblePool does not affect the evolving population during these stages. In the first stage, the framework uses global search operator to fully explore the decision space and determine the rough range of feasible solutions in the decision space. In the second stage, the framework uses local search operator to enhance the diversity of FeasiblePool within this determined range. In the last stage, the framework reuses these excellent feasible solutions information to guide population evolution while considering constraints. The proposed framework has been compared with four state-of-the-art constrained multi-objective algorithms on four benchmark suites and three real-world applications. The complete experimental results show that the proposed framework has high competitiveness for solving CMOPs. [ABSTRACT FROM AUTHOR]