Skip to main content

Elitist Archiving for Multi-Objective Evolutionary Algorithms: To Adapt or Not to Adapt

  • Conference paper

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

Abstract

Objective-space discretization is a popular method to control the elitist archive size for evolutionary multi-objective optimization and avoid problems with convergence. By setting the level of discretization, the proximity and diversity of the Pareto approximation set can be controlled. This paper proposes an adaptive archiving strategy which is developed from a rigid-grid discretization mechanism. The main advantage of this strategy is that the practitioner just decides the desirable target size for the elitist archive while all the maintenance details are automatically handled. We compare the adaptive and rigid archiving strategies on the basis of a performance indicator that measures front quality, success rate, and running time. Experimental results confirm the competitiveness of the adaptive method while showing its advantages in terms of transparency and ease of use.

Keywords

  • Multiobjective optimization
  • estimation of distribution algorithms
  • elitist archive

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bosman, P.A.N., Thierens, D.: The Balance between Proximity and Diversity in Multi–Objective Evolutionary Algorithms. IEEE Trans. Evol. Comput. 7(2), 174–188 (2003)

    CrossRef  Google Scholar 

  2. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evolutionary Computation 8(2), 173–195 (2000)

    CrossRef  Google Scholar 

  3. Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining Convergence and Diversity in Evolutionary Multiobjective Optimization. Evolutionary Computation 10(3), 263–282 (2002)

    CrossRef  Google Scholar 

  4. Hernandez-Diaz, A.G., Santana-Quintero, L.V., Coello Coello, C.A.: Pareto-adaptive -dominance. Evolutionary Computation 15(4), 493–517 (2007)

    CrossRef  Google Scholar 

  5. Knowles, J., Corne, D.: Properties of an adaptive archiving algorithm for storing nondominated vectors. IEEE Trans. Evol. Comput. 7(2), 100–116 (2003)

    CrossRef  Google Scholar 

  6. Bosman, P.A.N.: The Anticipated Mean Shift and Cluster Registration in Mixture-based EDAs for Multi-Objective Optimization. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO 2010, pp. 351–358. ACM, New York (2010)

    CrossRef  Google Scholar 

  7. López-Ibáñez, M., Knowles, J., Laumanns, M.: On Sequential Online Archiving of Objective Vectors. In: Takahashi, R.H.C., Deb, K., Wanner, E.F., Greco, S. (eds.) EMO 2011. LNCS, vol. 6576, pp. 46–60. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  8. Harada, K., Sakuma, J., Kobayashi, S.: Local Search for Multiobjective Function Optimization: Pareto Descent Method. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, GECCO 2006, pp. 659–666 (2006)

    Google Scholar 

  9. Bosman, P.A.N., de Jong, E.D.: Combining Gradient Techniques for Numerical Multi–Objective Evolutionary Optimization. Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, GECCO 2006, 627–634 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luong, H.N., Bosman, P.A.N. (2012). Elitist Archiving for Multi-Objective Evolutionary Algorithms: To Adapt or Not to Adapt. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds) Parallel Problem Solving from Nature - PPSN XII. PPSN 2012. Lecture Notes in Computer Science, vol 7492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32964-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32964-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32963-0

  • Online ISBN: 978-3-642-32964-7

  • eBook Packages: Computer ScienceComputer Science (R0)