[9563] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[13032] | 3 | * Copyright (C) 2002-2015 Joseph Helm and Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[9563] | 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 |
|
---|
[13032] | 22 |
|
---|
[9563] | 23 | using System.Collections.Generic;
|
---|
| 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
[14128] | 27 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
[9563] | 28 | using HeuristicLab.Optimization;
|
---|
| 29 | using HeuristicLab.Parameters;
|
---|
| 30 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 31 |
|
---|
| 32 | namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
|
---|
| 33 | [Item("Stochastic Insertion Move Generator", "Generates a number of possible Sequence moves from a given Sequence vector.")]
|
---|
| 34 | [StorableClass]
|
---|
| 35 | public class StochasticInsertionMoveGenerator : InsertionMoveGenerator, IMultiMoveGenerator, IStochasticOperator {
|
---|
| 36 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 37 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 38 | }
|
---|
| 39 | public IValueLookupParameter<IntValue> SampleSizeParameter {
|
---|
| 40 | get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | public IntValue SampleSize {
|
---|
| 44 | get { return SampleSizeParameter.Value; }
|
---|
| 45 | set { SampleSizeParameter.Value = value; }
|
---|
| 46 | }
|
---|
| 47 |
|
---|
| 48 | [StorableConstructor]
|
---|
| 49 | protected StochasticInsertionMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 50 | protected StochasticInsertionMoveGenerator(StochasticInsertionMoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 51 | public StochasticInsertionMoveGenerator()
|
---|
| 52 | : base() {
|
---|
| 53 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 54 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
| 55 | }
|
---|
| 56 |
|
---|
| 57 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 58 | return new StochasticInsertionMoveGenerator(this, cloner);
|
---|
| 59 | }
|
---|
| 60 |
|
---|
[14128] | 61 | public static InsertionMove[] Apply(Permutation packingSequence, IRandom random, int sampleSize) {
|
---|
[9563] | 62 |
|
---|
| 63 | int nrOfBins = 0;
|
---|
[14128] | 64 | foreach (int binNr in packingSequence) {
|
---|
[9563] | 65 | if (binNr > nrOfBins)
|
---|
| 66 | nrOfBins = binNr;
|
---|
| 67 | }
|
---|
| 68 | nrOfBins++;
|
---|
| 69 | var generatedMoves = new List<InsertionMove>();
|
---|
[14128] | 70 | var moves = new List<InsertionMove>(ExhaustiveInsertionMoveGenerator.Generate(packingSequence, nrOfBins));
|
---|
[9563] | 71 | int moveCount = moves.Count;
|
---|
| 72 | for (int i = 0; i < sampleSize; i++) {
|
---|
| 73 | generatedMoves.Add(moves[random.Next(moveCount)]);
|
---|
| 74 | }
|
---|
| 75 |
|
---|
| 76 | return generatedMoves.ToArray();
|
---|
| 77 | }
|
---|
| 78 |
|
---|
[14128] | 79 | protected override InsertionMove[] GenerateMoves(Permutation packingSequence) {
|
---|
[9563] | 80 | IRandom random = RandomParameter.ActualValue;
|
---|
[14128] | 81 | return Apply(packingSequence, random, SampleSizeParameter.ActualValue.Value);
|
---|
[9563] | 82 | }
|
---|
| 83 | }
|
---|
| 84 | }
|
---|