| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
|---|
| 4 | *
|
|---|
| 5 | * This file is part of HeuristicLab.
|
|---|
| 6 | *
|
|---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
|---|
| 8 | * it under the terms of the GNU General Public License as published by
|
|---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
|---|
| 10 | * (at your option) any later version.
|
|---|
| 11 | *
|
|---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
|---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 15 | * GNU General Public License for more details.
|
|---|
| 16 | *
|
|---|
| 17 | * You should have received a copy of the GNU General Public License
|
|---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 19 | */
|
|---|
| 20 | #endregion
|
|---|
| 21 | using System.Collections.Generic;
|
|---|
| 22 | using HeuristicLab.Core;
|
|---|
| 23 | using HeuristicLab.Encodings.RealVectorEncoding;
|
|---|
| 24 | using HeuristicLab.Optimization;
|
|---|
| 25 | using HEAL.Attic;
|
|---|
| 26 |
|
|---|
| 27 | namespace HeuristicLab.Algorithms.MOCMAEvolutionStrategy {
|
|---|
| 28 | [StorableType("5f3f2453-dbf0-46d8-be15-8b6bb9f88592")]
|
|---|
| 29 | public interface IIndicator : IItem {
|
|---|
| 30 | /// <summary>
|
|---|
| 31 | /// Selects the least contributing Point of a front. Please keep in mind, that the contribution of a point depends on its value as well as on the other points of a front.
|
|---|
| 32 | /// A particularly good point may not be as benefical in another front.
|
|---|
| 33 | /// </summary>
|
|---|
| 34 | /// <typeparam name="TR"></typeparam>
|
|---|
| 35 | /// <param name="front">a front which will be evaluated</param>
|
|---|
| 36 | /// <param name="problem">The problem on which the front is evaluated (!! The function itself will NOT be evluated only bounds referencePoints & other metadata will be used</param>
|
|---|
| 37 | /// <returns>the index of the least contributing point according to any type of quality criteria</returns>
|
|---|
| 38 | int LeastContributer(IReadOnlyList<Individual> front, MultiObjectiveBasicProblem<RealVectorEncoding> problem);
|
|---|
| 39 | }
|
|---|
| 40 | }
|
|---|
