source: branches/HeuristicLab.Algorithms.CMAEvolutionStrategy/sources/MOCMAES/IIndicator.cs @ 14269

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion
using System;
using HeuristicLab.Core;
using HeuristicLab.Problems.TestFunctions.MultiObjective;

namespace HeuristicLab.Algorithms.MOCMAEvolutionStrategy {
  public interface IIndicator : IItem {
    /// <summary>
    ///  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. 
    ///  A particularly good point may not be as benefical in another front.
    /// </summary>
    /// <typeparam name="R"></typeparam>
    /// <param name="front">a front which will be evaluated</param>
    /// <param name="extractor">some mapping function to map any R to double[]</param>
    /// <param name="problem">The problem on which the front is evaluated (!! The function itself will NOT be evluated only bounds referencePoints & other metadate will be used</param>
    /// <returns>the index of the least contributing point according to any type of quality criteria</returns>
    int LeastContributer<R>(R[] front, Func<R, double[]> extractor, MultiObjectiveTestFunctionProblem problem);
  }
}