A Fitness-assignment Method for Evolutionary Constrained Multi-objective Optimization
The effectiveness of Constrained Multi-Objective Evolutionary Algorithms (CMOEAs) depends on their ability to reach the different feasible regions during evolution, by exploiting the information present in infeasible solutions, in addition to optimizing the several conflicting objectives. Over the years, researchers have proposed several CMOEAs to handle Constrained Multi-objective Optimization Problems (CMOPs). However, most of the proposed CMOEAs with scalable performance are too complex because they are either multi-staged or multi-population-based algorithms. Consequently, to ensure the simplicity of CMOEAs, researchers have proposed different fitness-assignment-based CMOEAs by combining different fitness-assignment-based methods used to solve unconstrained multi-objective problems with information regarding the feasibility of each solution. The main performance drawback of such methods is that it is difficult to design a fitness assignment method that can account for constraint violation in addition to convergence and diversity. Hence in this paper, we propose an effective single-population fitness assignment-based CMOEA referred to as IcSDE+ that can explore different feasible regions in the search space. IcSDE+ is a fitness assignment-based algorithm, that is an efficient fusion of constraint violation (c), Shift-based Density Estimation (SDE), and sum of objectives (+). The performance of IcSDE+ is favorably compared against 9 state-of-the-art CMOEAs on 6 different benchmark suites with diverse characteristics.
Code (0)
등록된 구현이 없습니다.
Tasks
Density EstimationEvolutionary AlgorithmsMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multiobjective Optimization Differential Evolution Enhanced with Principle Component Analysis for Constrained Optimization
Multiobjective evolutionary algorithms (MOEAs) have been successfully applied to a number of constrained optimization problems. Many of them adopt mutation and crossover operators from differential evolution. However, th…
Evolutionary AlgorithmsMultiobjective OptimizationRDEx-CMOP: Feasibility-Aware Indicator-Guided Differential Evolution for Fixed-Budget Constrained Multiobjective Optimization
Constrained multiobjective optimisation requires fast feasibility attainment together with stable convergence and diversity preservation under strict evaluation budgets. This report documents RDEx-CMOP, the differential …
Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms
The fitness level method is a popular tool for analyzing the hitting time of elitist evolutionary algorithms. Its idea is to divide the search space into multiple fitness levels and estimate lower and upper bounds on the…
Evolutionary AlgorithmsEvolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits
Evolutionary multi-objective algorithms have been widely shown to be successful when utilized for a variety of stochastic combinatorial optimization problems. Chance constrained optimization plays an important role in co…
Combinatorial OptimizationEvolutionary AlgorithmsMulti-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem
Evolutionary algorithms are particularly effective for optimisation problems with dynamic and stochastic components. We propose multi-objective evolutionary approaches for the knapsack problem with stochastic profits und…
Evolutionary Algorithms