Handling constraints as objectives in a multiobjective genetic based algorithm
Résumé
In this paper, a novel approach based on handling constraints as objectives together with a modified Parks & Miller elitist technique, to solve constrained multiobjective optimization problems, is analyzed with Niched Pareto Genetic Algorithm. The performance of this approach is compared with the classical procedure of handling constraints that is the exterior penalty function method. Results are obtained applying both procedures of handling constraints, with and without elitism. Especially when using the modified elitist technique, simulation results suggest the effectiveness of the proposed technique.