[13672] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15583] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13672] | 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
|
---|
[14068] | 21 |
|
---|
[13620] | 22 | using System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 |
|
---|
[14111] | 27 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
[13620] | 28 | [StorableClass]
|
---|
| 29 | public abstract class DTLZ : MultiObjectiveTestFunction {
|
---|
[14068] | 30 | protected override IEnumerable<double[]> GetOptimalParetoFront(int objectives) {
|
---|
[14069] | 31 | if (objectives == 2) return ParetoFrontStore.GetParetoFront("DTLZ.ParetoFronts." + this.ItemName + ".2D");
|
---|
[13672] | 32 | return null;
|
---|
[13620] | 33 | }
|
---|
| 34 |
|
---|
[14068] | 35 | protected override double[,] GetBounds(int objectives) {
|
---|
[13672] | 36 | return new double[,] { { 0, 1 } };
|
---|
[13620] | 37 | }
|
---|
| 38 |
|
---|
[14068] | 39 | protected override bool[] GetMaximization(int objectives) {
|
---|
[13620] | 40 | return new bool[objectives];
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[14068] | 43 | protected override double[] GetReferencePoint(int objectives) {
|
---|
[13620] | 44 | double[] rp = new double[objectives];
|
---|
[13672] | 45 | for (int i = 0; i < objectives; i++) {
|
---|
[13620] | 46 | rp[i] = 11;
|
---|
| 47 | }
|
---|
| 48 | return rp;
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | [StorableConstructor]
|
---|
| 52 | protected DTLZ(bool deserializing) : base(deserializing) { }
|
---|
[13672] | 53 | protected DTLZ(DTLZ original, Cloner cloner) : base(original, cloner) { }
|
---|
[14067] | 54 | public DTLZ() : base(minimumObjectives: 2, maximumObjectives: int.MaxValue, minimumSolutionLength: 2, maximumSolutionLength: int.MaxValue) { }
|
---|
[13620] | 55 |
|
---|
| 56 | public abstract override double[] Evaluate(RealVector r, int objecitves);
|
---|
| 57 |
|
---|
| 58 | }
|
---|
| 59 | }
|
---|