As mentioned already, in constrained multi-objective problems, there exist some constraints to be satisfied, therefore
a constraint handling method (CHM) is required to handle the constraints. Many CHMs have been proposed in the
literature such as the constrained dominance principle [A fast and elitist multi-objective genetic algorithm: NSGA-
II], self-adaptive penalty function [Constraint handling in multi-objective evolutionary optimization], and stochastic
ranking [Infeasible Elitists and Stochastic Ranking Selection in Constrained Evolutionary Multi-objective
Optimization] methods [A Benchmark-Suite of real-World constrained multi-objective optimization problems and
some baseline results]. MOBRO uses the constrained dominance principle method. In this method, …. .
Extra explanation:
Pareto and dominating set definitions Aggregation of objectives allows single-objective optimizers
to effectively find Pareto optimal solutions. However, the main drawbacks of this approach
are the need to
run an algorithm multiple times to find multiple Pareto optimal solutions, dealing with all
the challenges in every run, lack of information exchange between Pareto optimal solutions
during optimization, the need to consult with an expert to find the best weights, and the
failure to find concave regions of Pareto optimal front due to the addition of objectives. Such
methods are called a priori because decision-making is done before the optimization within
determining the weights. Obviously, the disadvantages of a priori approaches outweigh their
benefits----
However, despite it using a mutation operator to improve its exploration ability, MOPSO
algorithm still