This paper describes an investigation of the efficacy of various elitist selection strategies in a multiobjective Genetic Algorithm implementation, with parents being selected both from the current population and from the archive record of nondominated solutions encountered during search. It is concluded that, because the multiobjective optimization process naturally maintains diversity in the population, it is possible to improve the performance of the algorithm through the use of strong elitism and high selection pressures without suffering the disadvantages of genetic convergence which such strategies would bring in single objective optimization.
CITATION STYLE
Parks, G. T., & Miller, I. (1998). Selective breeding in a multiobjective Genetic Algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1498 LNCS, pp. 250–259). Springer Verlag. https://doi.org/10.1007/bfb0056868
Mendeley helps you to discover research relevant for your work.