IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-10354-4_3.html
   My bibliography  Save this book chapter

A Hypervolume-Based Optimizer for High-Dimensional Objective Spaces

In: New Developments in Multiple Objective and Goal Programming

Author

Listed:
  • Johannes Bader

    (Computer Engineering and Networks Lab, ETH Zurich)

  • Eckart Zitzler

Abstract

In the field of evolutionary multiobjective optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with regard to Pareto dominance. This property is of high interest and relevance for multiobjective search involving a large number of objective functions. However, the high computational effort required for calculating the indicator values has so far prevented to fully exploit the potential of hypervolume-based multiobjective optimization. This paper addresses this issue and proposes a fast search algorithm that uses Monte Carlo sampling to approximate the exact hypervolume values. In detail, we present HypE (Hypervolume Estimation Algorithm for Multiobjective Optimization), by which the accuracy of the estimates and the available computing resources can be traded off; thereby, not only many-objective problems become feasible with hypervolume-based search, but also the runtime can be flexibly adapted. The experimental results indicate that HypE is highly effective for many-objective problems in comparison to existing multiobjective evolutionary algorithms.

Suggested Citation

  • Johannes Bader & Eckart Zitzler, 2010. "A Hypervolume-Based Optimizer for High-Dimensional Objective Spaces," Lecture Notes in Economics and Mathematical Systems, in: Dylan Jones & Mehrdad Tamiz & Jana Ries (ed.), New Developments in Multiple Objective and Goal Programming, pages 35-54, Springer.
  • Handle: RePEc:spr:lnechp:978-3-642-10354-4_3
    DOI: 10.1007/978-3-642-10354-4_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnechp:978-3-642-10354-4_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.