{
  "id": "enwiki-001377207326",
  "slug": "hypervolume-indicator",
  "title": "Hypervolume indicator",
  "qid": "",
  "lead": "[[File:Hypervolume-indicator-2d.svg|thumb|upright=1.25|alt=Two-dimensional objective space with five points forming a descending staircase; the region between the staircase and a reference point at the upper right is shaded.|The hypervolume indicator in two objectives: the shaded region is the union of the boxes [a (i) , r] spanned by the points of the approximation set and the reference point r; its area is HV(A; r). The hypervolume indicator is a performance indicator used in multi-objective optimization to measure the quality of a finite approximation of the Pareto frontier. It measures the Lebesgue measure of the region of objective space that is dominated by an approximation set and bounded by a specified reference point. In earlier multi-objective optimization literature, the same set-quality quantity was described using terms such as the Lebesgue measure, S-metric, and dominated hypervolume. These terms are now largely historical; the term hypervolume indicator has become the standard terminology in the literature. It is widely used both for comparing Pareto-front approximation sets and as an optimization criterion within multi-objective optimization algorithms. A distinguishing property of the hypervolume indicator is its strict Pareto compliance, also described as strict monotonicity with respect to set dominance.…",
  "body": "[[File:Hypervolume-indicator-2d.svg|thumb|upright=1.25|alt=Two-dimensional objective space with five points forming a descending staircase; the region between the staircase and a reference point at the upper right is shaded.|The hypervolume indicator in two objectives: the shaded region is the union of the boxes [a (i) ,&nbsp;r] spanned by the points of the approximation set and the reference point r; its area is HV(A;&nbsp;r). The hypervolume indicator is a performance indicator used in multi-objective optimization to measure the quality of a finite approximation of the Pareto frontier. It measures the Lebesgue measure of the region of objective space that is dominated by an approximation set and bounded by a specified reference point. In earlier multi-objective optimization literature, the same set-quality quantity was described using terms such as the Lebesgue measure, S-metric, and dominated hypervolume. These terms are now largely historical; the term hypervolume indicator has become the standard terminology in the literature. It is widely used both for comparing Pareto-front approximation sets and as an optimization criterion within multi-objective optimization algorithms. A distinguishing property of the hypervolume indicator is its strict Pareto compliance, also described as strict monotonicity with respect to set dominance. If one approximation set is strictly better than another according to Pareto dominance, then, under the same suitable reference point, it has a strictly larger hypervolume value. A=\\{\\mathbf{a}^{(1)},\\ldots,\\mathbf{a}^{(n)}\\}\\subset\\mathbb{R}^m be a finite approximation set in objective space. Let \\mathbf{r}\\in\\mathbb{R}^m be a reference point that is worse than the objective vectors of interest, so that a_i\\leq r_i for the relevant points and objectives. For each \\mathbf{a}\\in A , define the axis-aligned box [\\mathbf{a},\\mathbf{r}]=[a_1,r_1]\\times\\cdots\\times[a_m,r_m]. The hypervolume indicator of A with respect to \\mathbf{r} is HV(A;\\mathbf{r})=\\lambda_m\\left(\\bigcup_{\\mathbf{a}\\in A}[\\mathbf{a},\\mathbf{r}]\\right), where \\lambda_m denotes the m -dimensional Lebesgue measure. Thus, in two objective dimensions the hypervolume corresponds to an area, in three dimensions to a volume, and in higher dimensions to the corresponding multidimensional volume. Only the non-dominated points of an approximation set can contribute to its hypervolume. A point that is dominated by another point in the same set does not enlarge the dominated region. \\Delta HV(\\mathbf{a},A)=HV(A;\\mathbf{r})-HV(A\\setminus\\{\\mathbf{a}\\};\\mathbf{r}). Hypervolume contributions quantify the portion of the hypervolume that is lost when an individual point is removed. Their computation and efficient updating form a distinct family of computational problems associated with the hypervolume indicator. For low-dimensional problems, dedicated algorithms avoid recomputing the complete hypervolume after removing each point. Emmerich and Fonseca proved that computing all individual hypervolume contributions has tight time complexity \\Theta(n\\log n) for both two and three objectives. They also presented a dimension-sweep algorithm that computes all contributions in three objectives in O(n\\log n) time and O(n) space. Hypervolume contributions are particularly useful in selection and archiving procedures. For example, in SMS-EMOA the individual with the smallest hypervolume contribution in the worst-ranked non-dominated front is removed during environmental selection.",
  "categories": [
    "20181550",
    "20314946",
    "23603337",
    "26220375"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1377207326",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1790577605.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001377207326",
    "type": "webpage",
    "title": "Hypervolume indicator",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/hypervolume-indicator",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001377207326",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1377207326",
    "note": "Immutable snapshot enwiki-001377207326"
  }
}