[11484] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 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;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
[16565] | 26 | using HEAL.Attic;
|
---|
[11484] | 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.Programmable {
|
---|
| 29 | [Item("Single-objective Problem Definition Script", "Script that defines the parameter vector and evaluates the solution for a programmable problem.")]
|
---|
[16565] | 30 | [StorableType("D0B2A649-EDDE-4A6E-A3B5-F40F5FD1B2C0")]
|
---|
[11739] | 31 | public sealed class SingleObjectiveProblemDefinitionScript : ProblemDefinitionScript, ISingleObjectiveProblemDefinition, IStorableContent {
|
---|
[11484] | 32 | public string Filename { get; set; }
|
---|
| 33 |
|
---|
[11753] | 34 | private new ISingleObjectiveProblemDefinition CompiledProblemDefinition {
|
---|
| 35 | get { return (ISingleObjectiveProblemDefinition)base.CompiledProblemDefinition; }
|
---|
[11484] | 36 | }
|
---|
| 37 |
|
---|
| 38 | [StorableConstructor]
|
---|
[16565] | 39 | private SingleObjectiveProblemDefinitionScript(StorableConstructorFlag _) : base(_) { }
|
---|
[11739] | 40 | private SingleObjectiveProblemDefinitionScript(SingleObjectiveProblemDefinitionScript original, Cloner cloner) : base(original, cloner) { }
|
---|
[13218] | 41 | public SingleObjectiveProblemDefinitionScript() : base(ScriptTemplates.CompiledSingleObjectiveProblemDefinition) { }
|
---|
[11484] | 42 |
|
---|
| 43 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[11739] | 44 | return new SingleObjectiveProblemDefinitionScript(this, cloner);
|
---|
[11484] | 45 | }
|
---|
| 46 |
|
---|
[11739] | 47 | bool ISingleObjectiveProblemDefinition.Maximization {
|
---|
[11753] | 48 | get { return CompiledProblemDefinition.Maximization; }
|
---|
[11484] | 49 | }
|
---|
| 50 |
|
---|
[11739] | 51 | double ISingleObjectiveProblemDefinition.Evaluate(Individual individual, IRandom random) {
|
---|
| 52 | return CompiledProblemDefinition.Evaluate(individual, random);
|
---|
[11484] | 53 | }
|
---|
| 54 |
|
---|
[11880] | 55 | void ISingleObjectiveProblemDefinition.Analyze(Individual[] individuals, double[] qualities, ResultCollection results, IRandom random) {
|
---|
| 56 | CompiledProblemDefinition.Analyze(individuals, qualities, results, random);
|
---|
[11484] | 57 | }
|
---|
[11753] | 58 | IEnumerable<Individual> ISingleObjectiveProblemDefinition.GetNeighbors(Individual individual, IRandom random) {
|
---|
| 59 | return CompiledProblemDefinition.GetNeighbors(individual, random);
|
---|
| 60 | }
|
---|
[11484] | 61 | }
|
---|
| 62 | }
|
---|