source: branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/Operators/SingleObjectiveMoveGenerator.cs @ 11753

Last change on this file since 11753 was 11753, checked in by mkommend, 5 years ago

#2174: First working version of refactored programmable problem.

File size: 3.5 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Globalization;
25using System.Linq;
26using HeuristicLab.Common;
27using HeuristicLab.Core;
28using HeuristicLab.Data;
29using HeuristicLab.Operators;
30using HeuristicLab.Optimization;
31using HeuristicLab.Parameters;
32using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
33
34namespace HeuristicLab.Problems.Programmable {
35  [Item("Single-objective MoveGenerator", "Calls the GetNeighbors method of the problem definition to obtain the moves.")]
36  [StorableClass]
37  public class SingleObjectiveMoveGenerator : SingleSuccessorOperator, INeighborBasedOperator, IMultiMoveGenerator, IStochasticOperator, ISingleObjectiveMoveOperator {
38    public ILookupParameter<IRandom> RandomParameter {
39      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
40    }
41
42    public IValueLookupParameter<IntValue> SampleSizeParameter {
43      get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
44    }
45
46    public ILookupParameter<IEncoding> EncodingParameter {
47      get { return (ILookupParameter<IEncoding>)Parameters["Encoding"]; }
48    }
49
50    public Func<Individual, IRandom, IEnumerable<Individual>> GetNeighborsFunc { get; set; }
51
52    [StorableConstructor]
53    protected SingleObjectiveMoveGenerator(bool deserializing) : base(deserializing) { }
54    protected SingleObjectiveMoveGenerator(SingleObjectiveMoveGenerator original, Cloner cloner)
55      : base(original, cloner) { }
56    public SingleObjectiveMoveGenerator() {
57      Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
58      Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to sample."));
59      Parameters.Add(new LookupParameter<IEncoding>("Encoding", "An item that holds the problem's encoding."));
60    }
61
62    public override IDeepCloneable Clone(Cloner cloner) {
63      return new SingleObjectiveMoveGenerator(this, cloner);
64    }
65
66    public override IOperation Apply() {
67      var random = RandomParameter.ActualValue;
68      var sampleSize = SampleSizeParameter.ActualValue.Value;
69      var encoding = EncodingParameter.ActualValue;
70      var individual = encoding.GetIndividual(ExecutionContext.Scope);
71      var nbhood = GetNeighborsFunc(individual, random).Take(sampleSize).ToList();
72
73      var moveScopes = new Scope[nbhood.Count];
74      for (int i = 0; i < moveScopes.Length; i++) {
75        moveScopes[i] = new Scope(i.ToString(CultureInfo.InvariantCulture.NumberFormat));
76        nbhood[i].Copy(moveScopes[i]);
77      }
78      ExecutionContext.Scope.SubScopes.AddRange(moveScopes);
79
80      return base.Apply();
81    }
82  }
83}
Note: See TracBrowser for help on using the repository browser.