Ranking Pareto Optimal Solutions in Genetic Algorithm by Using the Undifferentiation Interval Method
Jerzy Montusiewicz · Kluwer Academic Publishers eBooks · 2006
The article shows a new method of ranking Pareto optimal solutions, which form a numerous set of nondominated solutions, by using the notion of optimality in the sense of an undifferentiation interval. The ranking algorithm presented is based on the filtration of a set of Pareto optimal solutions by using the undifferentiation interval method. The example presented shows that the generated subsets of nondominated solutions are given different ranks, which should contribute to an adequate crossover operation.