Conventional optimization algorithms using linear and non-linear programming sometimes have difficulty in finding the global optima or in case of multi-objective optimization, the pareto front. A lot of research has now been directed towards evoluti
NSGA (No n- Do mina te d So r ting in Ge ne tic Alg o r ithms [5 ]) is a p o pula r no n-do mina tio n ba s e d g e ne tic a lg o r ithm fo r multi- o b je c tive o ptimiz a tio n. I t is a ve r y e ffe c tive a lg o r ithm but ha s b e e n g e ne r
Decomposition is a basic strategy in traditional mul- tiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper proposes a multiobjective evolutionary algorithm based on decomposition
In this paper, we design a set of multi-objective constrained optimization problems (MCOPs) and propose a new repair operator to address them. The proposed repair operator is used to fix the solutions that violate the box constraints. More specifical
