Now showing items 1-2 of 2
A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation
Evolutionary algorithms (EAs) have shown to be efficient in dealing with many-objective optimization problems (MaOPs) due to their ability to obtain a set of compromising solutions which not only converge toward the Pareto ...
A prediction strategy based on center points and knee points for evolutionary dynamic multi-objective optimization
In real life, there are many dynamic multi-objective optimization problems which vary over time, requiring an optimization algorithm to track the movement of the Pareto front (Pareto set) with time. In this paper, we propose ...