Skip to main content

The Multiple Insertion Pyramid: A Fast Parameter-Less Population Scheme

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature – PPSN XIV (PPSN 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9921))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Google Scholar 

  2. Goldman, B.W., Punch, W.F.: Parameter-less population pyramid. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 785–792. ACM (2014)

    Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. Harik, G.R., Lobo, F.G.: A parameter-less genetic algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 258–267 (1999)

    Google Scholar 

  5. Thierens, D., Bosman, P.A.: Optimal mixing evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 617–624 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dirk Thierens .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics