[11484] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[11484] | 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 HeuristicLab.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Optimization;
|
---|
[16565] | 25 | using HEAL.Attic;
|
---|
[11484] | 26 |
|
---|
| 27 | namespace HeuristicLab.Problems.Programmable {
|
---|
| 28 | [Item("Multi-objective Problem Definition Script", "Script that defines the parameter vector and evaluates the solution for a programmable problem.")]
|
---|
[16565] | 29 | [StorableType("17741D64-CF9D-4CCF-9892-0590C325D4E6")]
|
---|
[13212] | 30 | public sealed class MultiObjectiveProblemDefinitionScript : ProblemDefinitionScript, IMultiObjectiveProblemDefinition, IStorableContent {
|
---|
[11484] | 31 | public string Filename { get; set; }
|
---|
| 32 |
|
---|
[11753] | 33 | private new IMultiObjectiveProblemDefinition CompiledProblemDefinition {
|
---|
| 34 | get { return (IMultiObjectiveProblemDefinition)base.CompiledProblemDefinition; }
|
---|
[11484] | 35 | }
|
---|
| 36 |
|
---|
| 37 | [StorableConstructor]
|
---|
[16565] | 38 | private MultiObjectiveProblemDefinitionScript(StorableConstructorFlag _) : base(_) { }
|
---|
[13218] | 39 | private MultiObjectiveProblemDefinitionScript(MultiObjectiveProblemDefinitionScript original, Cloner cloner) : base(original, cloner) { }
|
---|
| 40 | public MultiObjectiveProblemDefinitionScript() : base(ScriptTemplates.CompiledMultiObjectiveProblemDefinition) { }
|
---|
[11484] | 41 |
|
---|
| 42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[11739] | 43 | return new MultiObjectiveProblemDefinitionScript(this, cloner);
|
---|
[11484] | 44 | }
|
---|
| 45 |
|
---|
| 46 | bool[] IMultiObjectiveProblemDefinition.Maximization {
|
---|
[11753] | 47 | get { return CompiledProblemDefinition.Maximization; }
|
---|
[11484] | 48 | }
|
---|
| 49 |
|
---|
[11739] | 50 | double[] IMultiObjectiveProblemDefinition.Evaluate(Individual individual, IRandom random) {
|
---|
| 51 | return CompiledProblemDefinition.Evaluate(individual, random);
|
---|
[11484] | 52 | }
|
---|
| 53 |
|
---|
[11880] | 54 | void IMultiObjectiveProblemDefinition.Analyze(Individual[] individuals, double[][] qualities, ResultCollection results, IRandom random) {
|
---|
| 55 | CompiledProblemDefinition.Analyze(individuals, qualities, results, random);
|
---|
[11484] | 56 | }
|
---|
| 57 | }
|
---|
| 58 | }
|
---|