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