作者: Karl Bringmann , Tobias Friedrich , Patrick Klitzke
DOI: 10.1007/978-3-319-10762-2_51
关键词: Selection (genetic algorithm) 、 Evolutionary algorithm 、 Multi-objective optimization 、 Evolutionary computation 、 Mathematical optimization 、 Population 、 Process (computing) 、 Computer science 、 Fitness function
摘要: Most biobjective evolutionary algorithms maintain a population of fixed size μ and return the final at termination. During optimization process many solutions are considered, but most discarded. We present two generic postprocessing which utilize archive all non-dominated evaluated during search. choose best from such that hypervolume or e-indicator is maximized. This costs no additional fitness function evaluations has negligible runtime compared to EMOAs.