[13421] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13421] | 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 |
|
---|
[13620] | 22 | using System.Collections.Generic;
|
---|
[13421] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
| 25 |
|
---|
[14111] | 26 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
[13421] | 27 | /// <summary>
|
---|
[14065] | 28 | /// An interface which represents an multi objective test functions.
|
---|
[13421] | 29 | /// </summary>
|
---|
| 30 | public interface IMultiObjectiveTestFunction : INamedItem {
|
---|
[13620] | 31 | bool[] Maximization(int objectives);
|
---|
| 32 | double[,] Bounds(int objectives);
|
---|
[14085] | 33 |
|
---|
[13620] | 34 | IEnumerable<double[]> OptimalParetoFront(int objectives);
|
---|
[14085] | 35 | double OptimalHypervolume(int objectives);
|
---|
[13620] | 36 | double[] ReferencePoint(int objectives);
|
---|
[13421] | 37 |
|
---|
[13620] | 38 | int MinimumSolutionLength { get; }
|
---|
| 39 | int MaximumSolutionLength { get; }
|
---|
| 40 | int MinimumObjectives { get; }
|
---|
| 41 | int MaximumObjectives { get; }
|
---|
[13515] | 42 |
|
---|
[13620] | 43 | double[] Evaluate(RealVector point, int objectives);
|
---|
[13421] | 44 | }
|
---|
| 45 | }
|
---|