Skip to main content

An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization

  • 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

This work studies the behavior of three elitist multi- and many-objective evolutionary algorithms generating a high-resolution approximation of the Pareto optimal set. Several search-assessment indicators are defined to trace the dynamics of survival selection and measure the ability to simultaneously keep optimal solutions and discover new ones under different population sizes, set as a fraction of the size of the Pareto optimal set.

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. Aguirre, H., Tanaka, K.: Insights on Properties of Multi-objective MNK-Landscapes. In: Proc. 2004 IEEE Congress on Evolutionary Computation, pp. 196–203. IEEE Service Center (2004)

    Google Scholar 

  2. Nishio, Y., Oyama, A., Akimoto, Y., Aguirre, H., Tanaka, K.: Many-Objective Optimization of Trajectory Design for DESTINY Mission. In: Learning and Intelligent Optimization Conference. LNCS. Springer (2014)

    Google Scholar 

  3. Hadka, D., Reed, P.: Borg: An Auto-adaptive Many-objective Evolutionary Computing Framework. Evol. Computation 2(2), 231–259 (2013)

    Article  Google Scholar 

  4. Aguirre, H., Oyama, A., Tanaka, K.: Adaptive ε-Sampling and ε-Hood for Evolutionary Many-Objective Optimization. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds.) EMO 2013. LNCS, vol. 7811, pp. 322–336. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II., KanGAL report 200001 (2000)

    Google Scholar 

  6. Zitzler, E., Künzli, S.: Indicator-based Selection in Multiobjective Search. In: Yao, X., et al. (eds.) PPSN VIII. LNCS, vol. 3242, pp. 832–842. Springer, Heidelberg (2004)

    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

Aguirre, H., Liefooghe, A., Verel, S., Tanaka, K. (2014). An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization. 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_48

Download citation

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

  • 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