[11484] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16723] | 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 |
|
---|
[16751] | 22 | using HEAL.Attic;
|
---|
[11484] | 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
| 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.")]
|
---|
[16723] | 29 | [StorableType("17741D64-CF9D-4CCF-9892-0590C325D4E6")]
|
---|
[16751] | 30 | public sealed class MultiObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution> : ProblemDefinitionScript<TEncoding, TEncodedSolution>, IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>, IStorableContent
|
---|
| 31 | where TEncoding : class, IEncoding<TEncodedSolution>
|
---|
| 32 | where TEncodedSolution : class, IEncodedSolution {
|
---|
[11484] | 33 | public string Filename { get; set; }
|
---|
| 34 |
|
---|
[16751] | 35 | private new IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution> CompiledProblemDefinition {
|
---|
| 36 | get { return (IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>)base.CompiledProblemDefinition; }
|
---|
[11484] | 37 | }
|
---|
| 38 |
|
---|
| 39 | [StorableConstructor]
|
---|
[16723] | 40 | private MultiObjectiveProblemDefinitionScript(StorableConstructorFlag _) : base(_) { }
|
---|
[16751] | 41 | private MultiObjectiveProblemDefinitionScript(MultiObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution> original, Cloner cloner) : base(original, cloner) { }
|
---|
[13373] | 42 | public MultiObjectiveProblemDefinitionScript(string codeTemplate) : base(codeTemplate) { }
|
---|
| 43 | public MultiObjectiveProblemDefinitionScript() : base() { }
|
---|
[11484] | 44 |
|
---|
| 45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[16751] | 46 | return new MultiObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution>(this, cloner);
|
---|
[11484] | 47 | }
|
---|
| 48 |
|
---|
[16806] | 49 | int IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Objectives => CompiledProblemDefinition.Objectives;
|
---|
| 50 |
|
---|
[16751] | 51 | bool[] IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Maximization {
|
---|
[11753] | 52 | get { return CompiledProblemDefinition.Maximization; }
|
---|
[11484] | 53 | }
|
---|
| 54 |
|
---|
[16751] | 55 | double[] IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Evaluate(TEncodedSolution individual, IRandom random) {
|
---|
[11739] | 56 | return CompiledProblemDefinition.Evaluate(individual, random);
|
---|
[11484] | 57 | }
|
---|
| 58 |
|
---|
[16751] | 59 | void IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Analyze(TEncodedSolution[] individuals, double[][] qualities, ResultCollection results, IRandom random) {
|
---|
[11880] | 60 | CompiledProblemDefinition.Analyze(individuals, qualities, results, random);
|
---|
[11484] | 61 | }
|
---|
| 62 | }
|
---|
| 63 | }
|
---|