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 System;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Operators;
|
---|
28 | using HeuristicLab.Optimization;
|
---|
29 | using HeuristicLab.Parameters;
|
---|
30 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Problems.Programmable {
|
---|
33 | [Item("ParameterVectorMoveGenerator", "Calls the GetNeighbors method of the programmable definition to obtain the moves.")]
|
---|
34 | [StorableClass]
|
---|
35 | public class ParameterVectorMoveGenerator : InstrumentedOperator, IParameterVectorMoveOperator, IMultiMoveGenerator, IStochasticOperator {
|
---|
36 |
|
---|
37 | public ILookupParameter<IRandom> RandomParameter {
|
---|
38 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
39 | }
|
---|
40 |
|
---|
41 | public IValueLookupParameter<IntValue> SampleSizeParameter {
|
---|
42 | get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
43 | }
|
---|
44 |
|
---|
45 | public ILookupParameter<ISingleObjectiveProblemDefinitionHost> ProblemDefinitionParameter {
|
---|
46 | get { return (ILookupParameter<ISingleObjectiveProblemDefinitionHost>)Parameters["ProblemDefinition"]; }
|
---|
47 | }
|
---|
48 |
|
---|
49 | public ILookupParameter<Configuration> ConfigurationParameter {
|
---|
50 | get { return (ILookupParameter<Configuration>)Parameters["Configuration"]; }
|
---|
51 | }
|
---|
52 |
|
---|
53 | [StorableConstructor]
|
---|
54 | protected ParameterVectorMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
55 | protected ParameterVectorMoveGenerator(ParameterVectorMoveGenerator original, Cloner cloner)
|
---|
56 | : base(original, cloner) { }
|
---|
57 | public ParameterVectorMoveGenerator() {
|
---|
58 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
|
---|
59 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to sample."));
|
---|
60 | Parameters.Add(new LookupParameter<ISingleObjectiveProblemDefinitionHost>("ProblemDefinition", "The host that holds the problem definition."));
|
---|
61 | Parameters.Add(new LookupParameter<Configuration>("Configuration", "An item that holds the problem's configuration."));
|
---|
62 | }
|
---|
63 |
|
---|
64 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
65 | return new ParameterVectorMoveGenerator(this, cloner);
|
---|
66 | }
|
---|
67 |
|
---|
68 | public override IOperation InstrumentedApply() {
|
---|
69 | var random = RandomParameter.ActualValue;
|
---|
70 | var host = ProblemDefinitionParameter.ActualValue;
|
---|
71 | if (host.Instance == null) throw new InvalidOperationException("Problem definition instance is null.");
|
---|
72 | var sampleSize = SampleSizeParameter.ActualValue.Value;
|
---|
73 | var config = ConfigurationParameter.ActualValue;
|
---|
74 | var vector = Helper.Extract(ExecutionContext.Scope, config);
|
---|
75 | var nbhood = host.Instance.GetNeighbors(random, vector).Take(sampleSize).ToList();
|
---|
76 |
|
---|
77 | var moveScopes = new Scope[nbhood.Count];
|
---|
78 | for (int i = 0; i < moveScopes.Length; i++) {
|
---|
79 | moveScopes[i] = new Scope(i.ToString());
|
---|
80 | foreach (var param in nbhood[i].BinaryNames)
|
---|
81 | moveScopes[i].Variables.Add(new Variable(param, nbhood[i].BinaryVector(param)));
|
---|
82 |
|
---|
83 | foreach (var param in nbhood[i].IntegerNames)
|
---|
84 | moveScopes[i].Variables.Add(new Variable(param, nbhood[i].IntegerVector(param)));
|
---|
85 |
|
---|
86 | foreach (var param in nbhood[i].RealNames)
|
---|
87 | moveScopes[i].Variables.Add(new Variable(param, nbhood[i].RealVector(param)));
|
---|
88 |
|
---|
89 | foreach (var param in nbhood[i].PermutationNames)
|
---|
90 | moveScopes[i].Variables.Add(new Variable(param, nbhood[i].Permutation(param)));
|
---|
91 | }
|
---|
92 | ExecutionContext.Scope.SubScopes.AddRange(moveScopes);
|
---|
93 |
|
---|
94 | return base.InstrumentedApply();
|
---|
95 | }
|
---|
96 | }
|
---|
97 | }
|
---|