1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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 |
|
---|
22 | using System.Collections.Generic;
|
---|
23 | using HEAL.Attic;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.Programmable {
|
---|
30 | [Item("Multi-objective Problem Definition Script", "Script that defines the parameter vector and evaluates the solution for a programmable problem.")]
|
---|
31 | [StorableType("17741D64-CF9D-4CCF-9892-0590C325D4E6")]
|
---|
32 | public sealed class MultiObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution> : ProblemDefinitionScript<TEncoding, TEncodedSolution>, IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>, IStorableContent
|
---|
33 | where TEncoding : class, IEncoding<TEncodedSolution>
|
---|
34 | where TEncodedSolution : class, IEncodedSolution {
|
---|
35 | public string Filename { get; set; }
|
---|
36 |
|
---|
37 | private new IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution> CompiledProblemDefinition {
|
---|
38 | get { return (IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>)base.CompiledProblemDefinition; }
|
---|
39 | }
|
---|
40 |
|
---|
41 | [StorableConstructor]
|
---|
42 | private MultiObjectiveProblemDefinitionScript(StorableConstructorFlag _) : base(_) { }
|
---|
43 | private MultiObjectiveProblemDefinitionScript(MultiObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution> original, Cloner cloner) : base(original, cloner) { }
|
---|
44 | public MultiObjectiveProblemDefinitionScript(string codeTemplate) : base(codeTemplate) { }
|
---|
45 | public MultiObjectiveProblemDefinitionScript() : base() { }
|
---|
46 |
|
---|
47 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
48 | return new MultiObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution>(this, cloner);
|
---|
49 | }
|
---|
50 |
|
---|
51 | public int Objectives => CompiledProblemDefinition.Objectives;
|
---|
52 | public IReadOnlyList<double[]> BestKnownFront => CompiledProblemDefinition.BestKnownFront;
|
---|
53 | public double[] ReferencePoint => CompiledProblemDefinition.ReferencePoint;
|
---|
54 | public bool[] Maximization => CompiledProblemDefinition.Maximization;
|
---|
55 |
|
---|
56 |
|
---|
57 | double[] IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Evaluate(TEncodedSolution individual, IRandom random) {
|
---|
58 | return CompiledProblemDefinition.Evaluate(individual, random);
|
---|
59 | }
|
---|
60 |
|
---|
61 | void IMultiObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Analyze(TEncodedSolution[] individuals, double[][] qualities, ResultCollection results, IRandom random) {
|
---|
62 | CompiledProblemDefinition.Analyze(individuals, qualities, results, random);
|
---|
63 | }
|
---|
64 | }
|
---|
65 | } |
---|