Abstract
The Parameter-less Population Pyramid (P3) uses a novel population scheme, called the population pyramid. This population scheme does not require a fixed population size, instead it keeps adding new solutions to an ever growing set of layered populations. P3 is very efficient in terms of number of fitness function evaluations but its run-time is significantly higher than that of the Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) which uses the same method of exploration. This higher run-time is caused by the need to rebuild the linkage tree every time a single new solution is added to the population pyramid. We propose a new population scheme, called the multiple insertion pyramid that results in a faster variant of P3 by inserting multiple solutions at the same time and operating on populations instead of on single solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bosman, P.A., Thierens, D.: More concise and robust linkage learning by filtering and combining linkage hierarchies. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 359–366. ACM (2013)
Goldman, B.W., Punch, W.F.: Parameter-less population pyramid. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 785–792. ACM (2014)
Goldman, B.W., Punch, W.F.: Fast and efficient black box optimization using the parameter-less population pyramid. Evol. Comput. 23(3), 451–479 (2015)
Harik, G.R., Lobo, F.G.: A parameter-less genetic algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 258–267 (1999)
Thierens, D., Bosman, P.A.: Optimal mixing evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 617–624 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
den Besten, W., Thierens, D., Bosman, P.A.N. (2016). The Multiple Insertion Pyramid: A Fast Parameter-Less Population Scheme. In: Handl, J., Hart, E., Lewis, P., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds) Parallel Problem Solving from Nature – PPSN XIV. PPSN 2016. Lecture Notes in Computer Science(), vol 9921. Springer, Cham. https://doi.org/10.1007/978-3-319-45823-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-45823-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45822-9
Online ISBN: 978-3-319-45823-6
eBook Packages: Computer ScienceComputer Science (R0)