[11484] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17226] | 3 | * Copyright (C) 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 System.Collections.Generic;
|
---|
[17320] | 23 | using System.Threading;
|
---|
[16751] | 24 | using HEAL.Attic;
|
---|
[11484] | 25 | using HeuristicLab.Common;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Optimization;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.Programmable {
|
---|
| 30 | [Item("Single-objective Problem Definition Script", "Script that defines the parameter vector and evaluates the solution for a programmable problem.")]
|
---|
[16723] | 31 | [StorableType("D0B2A649-EDDE-4A6E-A3B5-F40F5FD1B2C0")]
|
---|
[16751] | 32 | public sealed class SingleObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution> : ProblemDefinitionScript<TEncoding, TEncodedSolution>, ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>, IStorableContent
|
---|
| 33 | where TEncoding : class, IEncoding<TEncodedSolution>
|
---|
| 34 | where TEncodedSolution : class, IEncodedSolution {
|
---|
[11484] | 35 | public string Filename { get; set; }
|
---|
| 36 |
|
---|
[16751] | 37 | private new ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution> CompiledProblemDefinition {
|
---|
| 38 | get { return (ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>)base.CompiledProblemDefinition; }
|
---|
[11484] | 39 | }
|
---|
| 40 |
|
---|
| 41 | [StorableConstructor]
|
---|
[16723] | 42 | private SingleObjectiveProblemDefinitionScript(StorableConstructorFlag _) : base(_) { }
|
---|
[16751] | 43 | private SingleObjectiveProblemDefinitionScript(SingleObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution> original, Cloner cloner) : base(original, cloner) { }
|
---|
[13345] | 44 | public SingleObjectiveProblemDefinitionScript(string codeTemplate) : base(codeTemplate) { }
|
---|
| 45 | public SingleObjectiveProblemDefinitionScript() { }
|
---|
[11484] | 46 |
|
---|
| 47 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[16751] | 48 | return new SingleObjectiveProblemDefinitionScript<TEncoding, TEncodedSolution>(this, cloner);
|
---|
[11484] | 49 | }
|
---|
| 50 |
|
---|
[17225] | 51 | public bool Maximization => CompiledProblemDefinition.Maximization;
|
---|
[11484] | 52 |
|
---|
[17382] | 53 | ISingleObjectiveEvaluationResult ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Evaluate(TEncodedSolution solution, IRandom random) {
|
---|
[17320] | 54 | return CompiledProblemDefinition.Evaluate(solution, random);
|
---|
[11484] | 55 | }
|
---|
| 56 |
|
---|
[17382] | 57 | ISingleObjectiveEvaluationResult ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Evaluate(TEncodedSolution solution, IRandom random, CancellationToken cancellationToken) {
|
---|
[17320] | 58 | return CompiledProblemDefinition.Evaluate(solution, random, cancellationToken);
|
---|
| 59 | }
|
---|
| 60 |
|
---|
[17363] | 61 | void ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Evaluate(ISingleObjectiveSolutionContext<TEncodedSolution> solutionContext, IRandom random) {
|
---|
| 62 | CompiledProblemDefinition.Evaluate(solutionContext, random, CancellationToken.None);
|
---|
| 63 | }
|
---|
| 64 | void ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Evaluate(ISingleObjectiveSolutionContext<TEncodedSolution> solutionContext, IRandom random, CancellationToken cancellationToken) {
|
---|
[17366] | 65 | CompiledProblemDefinition.Evaluate(solutionContext, random, cancellationToken);
|
---|
[17363] | 66 | }
|
---|
| 67 |
|
---|
[16751] | 68 | void ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Analyze(TEncodedSolution[] individuals, double[] qualities, ResultCollection results, IRandom random) {
|
---|
[11880] | 69 | CompiledProblemDefinition.Analyze(individuals, qualities, results, random);
|
---|
[11484] | 70 | }
|
---|
[17363] | 71 | void ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.Analyze(ISingleObjectiveSolutionContext<TEncodedSolution>[] solutionContexts, ResultCollection results, IRandom random) {
|
---|
| 72 | CompiledProblemDefinition.Analyze(solutionContexts, results, random);
|
---|
| 73 | }
|
---|
| 74 |
|
---|
| 75 |
|
---|
[16751] | 76 | IEnumerable<TEncodedSolution> ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.GetNeighbors(TEncodedSolution individual, IRandom random) {
|
---|
[11753] | 77 | return CompiledProblemDefinition.GetNeighbors(individual, random);
|
---|
| 78 | }
|
---|
[17363] | 79 | IEnumerable<ISingleObjectiveSolutionContext<TEncodedSolution>> ISingleObjectiveProblemDefinition<TEncoding, TEncodedSolution>.GetNeighbors(ISingleObjectiveSolutionContext<TEncodedSolution> solutionContext, IRandom random) {
|
---|
| 80 | return CompiledProblemDefinition.GetNeighbors(solutionContext, random);
|
---|
| 81 | }
|
---|
[13361] | 82 |
|
---|
[17225] | 83 | public bool IsBetter(double quality, double bestQuality) {
|
---|
[13361] | 84 | return CompiledProblemDefinition.IsBetter(quality, bestQuality);
|
---|
| 85 | }
|
---|
[11484] | 86 | }
|
---|
[17225] | 87 | } |
---|