The influence of non-constant population sizes in evolutionary multi-objective optimization algorithms is investigated. In contrast to evolutionary single-objective optimization algorithms an increasing population size is considered beneficial when approaching the Pareto-front. Firstly, different deterministic schedules are tested, featuring different parameters like the initial population size. Secondly, a simple adaptation method is proposed. Considering all results, an increasing population size during an evolutionary multi-objective optimization algorithm run saves fitness function evaluations compared to a fixed population size. In particular, the results obtained with the adaptive method are most promising.
CITATION STYLE
Glasmachers, T., Naujoks, B., & Rudolph, G. (2014). Start small, grow big? Saving multi-objective function evaluations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8672, 579–588. https://doi.org/10.1007/978-3-319-10762-2_57
Mendeley helps you to discover research relevant for your work.