1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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.Common;
|
---|
23 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Problems.MultiObjectiveTestFunctions {
|
---|
27 | [StorableClass]
|
---|
28 | public abstract class DTLZ : MultiObjectiveTestFunction {
|
---|
29 |
|
---|
30 |
|
---|
31 | public override IEnumerable<double[]> OptimalParetoFront(int objectives) {
|
---|
32 | if (objectives == 2) return PFStore.get(this.ItemName + ".2D");
|
---|
33 | return null;
|
---|
34 | }
|
---|
35 |
|
---|
36 | public override double[,] Bounds(int objectives) {
|
---|
37 | return new double[,] { { 0, 1 } };
|
---|
38 | }
|
---|
39 |
|
---|
40 | public override bool[] Maximization(int objectives) {
|
---|
41 | return new bool[objectives];
|
---|
42 | }
|
---|
43 |
|
---|
44 | public override int MinimumSolutionLength {
|
---|
45 | get { return 2; }
|
---|
46 | }
|
---|
47 | public override int MaximumSolutionLength {
|
---|
48 | get { return int.MaxValue; }
|
---|
49 | }
|
---|
50 |
|
---|
51 |
|
---|
52 | public override int MinimumObjectives {
|
---|
53 | get { return 2; }
|
---|
54 | }
|
---|
55 | public override int MaximumObjectives {
|
---|
56 | get { return int.MaxValue; }
|
---|
57 | }
|
---|
58 |
|
---|
59 | public override double[] ReferencePoint(int objectives) {
|
---|
60 | double[] rp = new double[objectives];
|
---|
61 | for (int i = 0; i < objectives; i++) {
|
---|
62 | rp[i] = 11;
|
---|
63 | }
|
---|
64 | return rp;
|
---|
65 | }
|
---|
66 |
|
---|
67 | [StorableConstructor]
|
---|
68 | protected DTLZ(bool deserializing) : base(deserializing) { }
|
---|
69 | protected DTLZ(DTLZ original, Cloner cloner) : base(original, cloner) { }
|
---|
70 | public DTLZ() : base(minimumObjectives: 2, minimumSolutionLength: 2, maximumSolutionLength: int.MaxValue) { }
|
---|
71 |
|
---|
72 | public abstract override double[] Evaluate(RealVector r, int objecitves);
|
---|
73 |
|
---|
74 | }
|
---|
75 | }
|
---|