[7407] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16728] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7407] | 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.Data;
|
---|
| 26 | using HeuristicLab.Encodings.IntegerVectorEncoding;
|
---|
| 27 | using HeuristicLab.Optimization;
|
---|
| 28 | using HeuristicLab.Parameters;
|
---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[16728] | 30 | using HEAL.Attic;
|
---|
[7407] | 31 |
|
---|
| 32 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
|
---|
[7505] | 33 | [Item("Stochastic N-Move MultiMoveGenerator", "Randomly samples a number of N-Moves.")]
|
---|
[16728] | 34 | [StorableType("EEE53E16-0FB6-4041-A9AC-ECDA5E73A505")]
|
---|
[15504] | 35 | public class StochasticNMoveMultiMoveGenerator : GQAPNMoveGenerator, IStochasticOperator, IMultiMoveGenerator {
|
---|
| 36 |
|
---|
[7407] | 37 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 38 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 39 | }
|
---|
| 40 | public IValueLookupParameter<IntValue> SampleSizeParameter {
|
---|
| 41 | get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
| 42 | }
|
---|
| 43 |
|
---|
| 44 | [StorableConstructor]
|
---|
[16728] | 45 | protected StochasticNMoveMultiMoveGenerator(StorableConstructorFlag _) : base(_) { }
|
---|
[7407] | 46 | protected StochasticNMoveMultiMoveGenerator(StochasticNMoveMultiMoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 47 | public StochasticNMoveMultiMoveGenerator()
|
---|
| 48 | : base() {
|
---|
| 49 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator that should be used."));
|
---|
| 50 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 54 | return new StochasticNMoveMultiMoveGenerator(this, cloner);
|
---|
| 55 | }
|
---|
| 56 |
|
---|
[15504] | 57 | public static IEnumerable<NMove> Generate(IRandom random, IntegerVector assignment, int n, GQAPInstance problemInstance, int sampleSize) {
|
---|
[7407] | 58 | for (int i = 0; i < sampleSize; i++)
|
---|
[15504] | 59 | yield return StochasticNMoveSingleMoveGenerator.GenerateUpToN(random, assignment, n, problemInstance.Capacities);
|
---|
[7407] | 60 | }
|
---|
| 61 |
|
---|
[15504] | 62 | public override IEnumerable<NMove> GenerateMoves(IntegerVector assignment, int n, GQAPInstance problemInstance) {
|
---|
| 63 | return Generate(RandomParameter.ActualValue, assignment, n, problemInstance, SampleSizeParameter.ActualValue.Value);
|
---|
[7407] | 64 | }
|
---|
| 65 | }
|
---|
| 66 | }
|
---|