Skip to main content

Some Demonstrations about the Cardinality of Important Sets of Non–dominated Sets

  • Conference paper
MICAI 2008: Advances in Artificial Intelligence (MICAI 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5317))

Included in the following conference series:

Abstract

In multiobjective optimization, a very important element is the space of objective functions, usually called Z. The set of Ω of all non–dominated sets that we can generate with elements of Z is especially interesting, because it represent all possible output from an evolutionary multiobjective algorithm. In this study, we make some theoretical demonstrations about the cardinality of Ω and others important sets of non–dominated sets. After, we use these demonstrations to prove some theorems in the area of performance measures for evolutionary multiobjective algorithms.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Carlos, D.V., Coello, A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic/Plenum Publishers, New York (2002)

    MATH  Google Scholar 

  2. Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. John Wiley and Sons, Chichester (2001)

    MATH  Google Scholar 

  3. Fraenkel, A.A.: Set Theory and Logic. Addison–Wesley Publishing Company, Reading (1966)

    MATH  Google Scholar 

  4. Kamke, E.: Theory of Sets. Dover Publications, Inc., New York (1950)

    MATH  Google Scholar 

  5. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 529–533 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lizárraga, G., Hernández, A., Botello, S. (2008). Some Demonstrations about the Cardinality of Important Sets of Non–dominated Sets. In: Gelbukh, A., Morales, E.F. (eds) MICAI 2008: Advances in Artificial Intelligence. MICAI 2008. Lecture Notes in Computer Science(), vol 5317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88636-5_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88636-5_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88635-8

  • Online ISBN: 978-3-540-88636-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics