Full Elite Sets for Multi-Objective Optimisation
Everson, Richard M.; Fieldsend, Jonathan E.; Singh, Sameer
Date: 18 April 2002
Conference paper
Publisher
Springer
Publisher DOI
Abstract
Multi-objective evolutionary algorithms frequently use an archive of non-dominated solutions to approximate the Pareto front. We show that the truncation of this archive to a limited number of solutions can lead to oscillating and shrinking estimates of the Pareto front. New data structures to permit efficient query and update of the ...
Multi-objective evolutionary algorithms frequently use an archive of non-dominated solutions to approximate the Pareto front. We show that the truncation of this archive to a limited number of solutions can lead to oscillating and shrinking estimates of the Pareto front. New data structures to permit efficient query and update of the full archive are proposed, and the superior quality of frontal estimates found using the full archive is illustrated on test problems.
Computer Science
Faculty of Environment, Science and Economy
Item views 0
Full item downloads 0