Skip to main content

Start Small, Grow Big? Saving Multi-objective Function Evaluations

  • Conference paper
Parallel Problem Solving from Nature – PPSN XIII (PPSN 2014)

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

Included in the following conference series:

Abstract

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.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bader, J., Zitzler, E.: HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization. Evolutionary Computation 19(1), 45–76 (2011)

    Article  Google Scholar 

  2. Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: Multiobjective selection based on dominated hypervolume. European Journal of Operational Research 181(3), 1653–1669 (2007)

    Article  MATH  Google Scholar 

  3. Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems, 2nd edn. Springer, New York (2007)

    MATH  Google Scholar 

  4. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Chichester (2001)

    Google Scholar 

  5. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Multi-Objective Optimization Test Problems. In: Congress on Evolutionary Computation, CEC 2002, pp. 825–830. IEEE Press, Piscataway (2002)

    Google Scholar 

  6. DeJong, K.A.: Evolutionary Computation: A Unified Approach. MIT Press, Cambridge (2006)

    Google Scholar 

  7. Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series. Springer, Berlin (2003)

    Book  MATH  Google Scholar 

  8. Eskandari, H., Geiger, C.D., Lamont, G.B.: FastPGA: A dynamic population sizing approach for solving expensive multiobjective optimization problems. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 141–155. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Igel, C., Hansen, N., Roth, S.: Covariance Matrix Adaptation for Multi-objective Optimization. Evolutionary Computation 15(1), 1–28 (2007)

    Article  Google Scholar 

  10. Laumanns, M.: Analysis and Applications of Evolutionary Multiobjective Optimization Algorithms. Ph.D. thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (2003)

    Google Scholar 

  11. Lu, H., Yen, G.G.: Dynamic population size in multiobjective evolutionary algorithms. In: Proceedings of the 2002 IEEE Congress on Evolutionary Computation, CEC 2002, pp. 1648–1653. IEEE Press, Piscataway (2002)

    Google Scholar 

  12. Peschel, M., Riedel, C.: Use of vector optimization in multiobjective decision making. In: Bell, D.E., Keeney, R.L., Raiffa, H. (eds.) Conflicting Objectives in Decisions, pp. 97–121. Wiley, Chichester (1977)

    Google Scholar 

  13. Rudolph, G., Agapie, A.: Convergence properties of some multi-objective evolutionary algorithms. In: Zalzala, A., et al. (eds.) Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000, vol. 2, pp. 1010–1016. IEEE Press, Piscataway (2000)

    Google Scholar 

  14. Tan, K.C., Lee, T.H., Khor, E.F.: Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization. IEEE Transactions on Evolutionary Computation 5(6), 565–588 (2001)

    Article  Google Scholar 

  15. Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. Ph.D. thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (November 1999)

    Google Scholar 

  16. Zitzler, E., Deb, K., Thiele, L.: Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation 8(2), 173–195 (2000)

    Article  Google Scholar 

  17. Zitzler, E., Thiele, L.: Multiobjective Optimization Using Evolutionary Algorithms—A Comparative Study. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN V. LNCS, vol. 1498, pp. 292–301. Springer, Heidelberg (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Glasmachers, T., Naujoks, B., Rudolph, G. (2014). Start Small, Grow Big? Saving Multi-objective Function Evaluations. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10762-2_57

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10761-5

  • Online ISBN: 978-3-319-10762-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics