#region License Information /* HeuristicLab * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Encodings.RealVectorEncoding; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Problems.TestFunctions.MultiObjective { [Item("ZDT2", "ZDT2 function as defined in http://www.tik.ee.ethz.ch/sop/download/supplementary/testproblems/ [30.11.2015]")] [StorableClass] public class ZDT2 : ZDT { protected override double GetBestKnownHypervolume(int objectives) { return 120 + 1.0 / 3; } [StorableConstructor] protected ZDT2(bool deserializing) : base(deserializing) { } protected ZDT2(ZDT2 original, Cloner cloner) : base(original, cloner) { } public override IDeepCloneable Clone(Cloner cloner) { return new ZDT2(this, cloner); } public ZDT2() : base() { } public override double[] Evaluate(RealVector r) { double g = 0; for (int i = 1; i < r.Length; i++) g += r[i]; g = 1.0 + 9.0 * g / (r.Length - 1); double d = r[0] / g; double f0 = r[0]; double f1 = g * (1.0 - d * d); return new double[] { f0, f1 }; } } }