Skip to main content

A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume

  • Conference paper
Evolutionary Multi-Criterion Optimization (EMO 2005)

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

Included in the following conference series:

Abstract

We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the number of objectives in the worst case, not polynomial as has been claimed previously. This result has important implications for anyone planning to use hypervolume, either as a metric to compare optimisation algorithms, or as part of a diversity mechanism in an evolutionary algorithm.

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. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE TEC 6(2), 182–197 (2002)

    Google Scholar 

  2. Fleischer, M.: The measure of Pareto optima: Applications to multi-objective metaheuristics. Technical Report ISR TR 2002-32, University of Maryland (2002)

    Google Scholar 

  3. Fleischer, M.: The measure of Pareto optima: Applications to multi-objective metaheuristics. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 519–533. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Huband, S., Hingston, P., While, L., Barone, L.: An evolution strategy with probabilistic mutation for multi-objective optimization. In: CEC 2003, vol. 4, pp. 2284–2291. IEEE, Los Alamitos (2003)

    Google Scholar 

  5. Knowles, J., Corne, D.: M-PAES: A memetic algorithm for multi-objective optimization. In: CEC 2000, vol. 1, pp. 325–332. IEEE, Los Alamitos (2000)

    Google Scholar 

  6. Knowles, J., Corne, D., Fleischer, M.: Bounded archiving using the Lebesgue measure. In: CEC 2003, vol. 4, pp. 2490–2497. IEEE, Los Alamitos (2003)

    Google Scholar 

  7. Okabe, T., Jin, Y., Sendhoff, B.: A critical survey of performance indices for multi-objective optimisation. In: CEC 2003, vol. 2, pp. 878–885. IEEE, Los Alamitos (2003)

    Google Scholar 

  8. Purshouse, R.: On the evolutionary optimisation of many objectives. PhD thesis, The University of Sheffield (2003)

    Google Scholar 

  9. Wu, J., Azarm, S.: Metrics for quality assessment of a multi-objective design optimization solution set. Journal of Mechanical Design 123, 18–25 (2001)

    Article  Google Scholar 

  10. Zitzler, E.: Evolutionary algorithms for multi-objective optimization: Methods and applications. PhD thesis, Swiss Federal Inst of Technology (ETH) Zurich (1999)

    Google Scholar 

  11. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm for multi-objective optimization. In: EUROGEN 2001, Int Center for Numerical Methods in Engineering, Barcelona, pp. 95–100 (2001)

    Google Scholar 

  12. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multi-objective optimizers: An analysis and review. IEEE TEC 7(2), 117–132 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

While, L. (2005). A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds) Evolutionary Multi-Criterion Optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31880-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24983-2

  • Online ISBN: 978-3-540-31880-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics