[13672] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 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
|
---|
| 21 | using System;
|
---|
[13620] | 22 | using System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
[16565] | 25 | using HEAL.Attic;
|
---|
[13620] | 26 |
|
---|
[14111] | 27 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
[16565] | 28 | [StorableType("A8192C08-A1DA-479A-9381-9B634761B521")]
|
---|
[13672] | 29 | public abstract class ZDT : MultiObjectiveTestFunction {
|
---|
[14068] | 30 | protected override IEnumerable<double[]> GetOptimalParetoFront(int objectives) {
|
---|
[14069] | 31 | return ParetoFrontStore.GetParetoFront("ZDT.ParetoFronts." + this.ItemName);
|
---|
[13620] | 32 | }
|
---|
| 33 |
|
---|
[14068] | 34 | protected override double[,] GetBounds(int objectives) {
|
---|
[13620] | 35 | return new double[,] { { 0, 1 } };
|
---|
| 36 | }
|
---|
| 37 |
|
---|
[14068] | 38 | protected override bool[] GetMaximization(int objectives) {
|
---|
[13672] | 39 | return new bool[objectives];
|
---|
[13620] | 40 | }
|
---|
| 41 |
|
---|
[14068] | 42 | protected override double[] GetReferencePoint(int objecitives) {
|
---|
[13620] | 43 | return new double[] { 11.0, 11.0 };
|
---|
| 44 | }
|
---|
| 45 |
|
---|
[14068] | 46 | protected override double GetBestKnownHypervolume(int objectives) {
|
---|
[13620] | 47 | return -1;
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | [StorableConstructor]
|
---|
[16565] | 51 | protected ZDT(StorableConstructorFlag _) : base(_) { }
|
---|
[14067] | 52 | protected ZDT(MultiObjectiveTestFunction original, Cloner cloner)
|
---|
| 53 | : base(original, cloner) {
|
---|
[13620] | 54 | }
|
---|
[14067] | 55 | protected ZDT() : base(minimumObjectives: 2, maximumObjectives: 2, minimumSolutionLength: 1, maximumSolutionLength: int.MaxValue) { }
|
---|
[13620] | 56 |
|
---|
| 57 | public override double[] Evaluate(RealVector r, int objectives) {
|
---|
| 58 | if (objectives != 2) throw new ArgumentException("ZDT Problems must always have 2 objectives");
|
---|
| 59 | return Evaluate(r);
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | public abstract double[] Evaluate(RealVector r);
|
---|
| 63 | }
|
---|
| 64 | }
|
---|