Investigating EA solutions for approximate KKT conditions in smooth problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
An earlier study defined a KKT-proximity measure to test the convergence property of an evolutionary algorithm for solving single-objective optimization problems. In this paper, we extend this measure for testing convergence of a set of non-dominated solutions to the Pareto-optimal front in the case of smooth multi-objective optimization problems. Simulation results of NSGA-II on different two and three objective test problems indicate the suitability of using the proximity measure as a convergence metric for terminating a simulation of an evolutionary multi-criterion optimization algorithm.