1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2014 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 HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Problems.Programmable {
|
---|
27 | [Item("Single-objective Script", "Script that defines the parameter vector and evaluates the solution for a programmable problem.")]
|
---|
28 | [StorableClass]
|
---|
29 | public class SingleObjectiveScript : ProgrammableProblemScript, IStorableContent {
|
---|
30 | public string Filename { get; set; }
|
---|
31 |
|
---|
32 | [StorableConstructor]
|
---|
33 | protected SingleObjectiveScript(bool deserializing) : base(deserializing) { }
|
---|
34 | protected SingleObjectiveScript(SingleObjectiveScript original, Cloner cloner)
|
---|
35 | : base(original, cloner) { }
|
---|
36 |
|
---|
37 | public SingleObjectiveScript() {
|
---|
38 | Code = CodeTemplate;
|
---|
39 | }
|
---|
40 |
|
---|
41 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
42 | return new SingleObjectiveScript(this, cloner);
|
---|
43 | }
|
---|
44 |
|
---|
45 | public new ISingleObjectiveProblemDefinition Instance {
|
---|
46 | get { return (ISingleObjectiveProblemDefinition)base.Instance; }
|
---|
47 | protected set { base.Instance = value; }
|
---|
48 | }
|
---|
49 |
|
---|
50 | protected override string CodeTemplate {
|
---|
51 | get {
|
---|
52 | return @"using System;
|
---|
53 | using System.Linq;
|
---|
54 | using System.Collections.Generic;
|
---|
55 | using HeuristicLab.Common;
|
---|
56 | using HeuristicLab.Core;
|
---|
57 | using HeuristicLab.Data;
|
---|
58 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
59 | using HeuristicLab.Problems.Programmable;
|
---|
60 |
|
---|
61 | public class ProblemDefinition : ISingleObjectiveProblemDefinition {
|
---|
62 | public ProblemDefinition() {
|
---|
63 | // initialize private fields
|
---|
64 | }
|
---|
65 |
|
---|
66 | public bool IsMaximizationProblem { get { return false; } }
|
---|
67 |
|
---|
68 | public Configuration GetConfiguration() {
|
---|
69 | return new Configuration()
|
---|
70 | // .AddBinary(""b"", length: 5)
|
---|
71 | // .AddInteger(""i"", length: 5, min: 2, max: 14, step: 4)
|
---|
72 | // .AddReal(""r"", length: 5, min: -1.0, max: 1.0)
|
---|
73 | // .AddPermutation(""P"", length: 5, type: PermutationTypes.Absolute)
|
---|
74 | ;
|
---|
75 | }
|
---|
76 |
|
---|
77 | public double Evaluate(IRandom random, ParameterVector vector) {
|
---|
78 | var quality = 0.0;
|
---|
79 | // quality = vector.Real(""r"").Select(x => x * x).Sum();
|
---|
80 | return quality;
|
---|
81 | }
|
---|
82 |
|
---|
83 | public IEnumerable<ParameterVector> GetNeighbors(IRandom random, ParameterVector vector) {
|
---|
84 | // Create new vectors, based on the given one that represent small changes
|
---|
85 | // This method is only called from move-based algorithms (LocalSearch, SimulatedAnnealing, etc.)
|
---|
86 | while (true) {
|
---|
87 | var neighbor = (ParameterVector)vector.Clone();
|
---|
88 | //e.g. make a bit flip in a binary parameter
|
---|
89 | //var bIndex = random.Next(neighbor.Binary(""b"").Length);
|
---|
90 | //neighbor.Binary(""b"")[bIndex] = !neighbor.Binary(""b"")[bIndex];
|
---|
91 | yield return neighbor;
|
---|
92 | }
|
---|
93 | }
|
---|
94 |
|
---|
95 | // implement further classes and methods
|
---|
96 | }";
|
---|
97 | }
|
---|
98 | }
|
---|
99 | }
|
---|
100 | }
|
---|