Research Article
A Multiobjective Genetic Algorithm for the Localization of Optimal and Nearly Optimal Solutions Which Are Potentially Useful: nevMOGA
Figure 4
An example of discretization of a MOP with nevMOGA. is discarded because it is -box dominated (i.e., box dominated by neighboring solutions) by . is eliminated since there is a neighboring solution () in the same box () with less distance to the ideal corner ().
(a) |
(b) |