1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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.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;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
|
---|
32 | [Item("Stochastic N-Move MultiMoveGenerator", "Randomly samples a number of N-Moves.")]
|
---|
33 | [StorableClass]
|
---|
34 | public class StochasticNMoveMultiMoveGenerator : GQAPNMoveGenerator, ICapacitiesAwareGQAPOperator, IStochasticOperator, IMultiMoveGenerator {
|
---|
35 |
|
---|
36 | public ILookupParameter<DoubleArray> CapacitiesParameter {
|
---|
37 | get { return (ILookupParameter<DoubleArray>)Parameters["Capacities"]; }
|
---|
38 | }
|
---|
39 | public ILookupParameter<IRandom> RandomParameter {
|
---|
40 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
41 | }
|
---|
42 | public IValueLookupParameter<IntValue> SampleSizeParameter {
|
---|
43 | get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
44 | }
|
---|
45 |
|
---|
46 | [StorableConstructor]
|
---|
47 | protected StochasticNMoveMultiMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
48 | protected StochasticNMoveMultiMoveGenerator(StochasticNMoveMultiMoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
49 | public StochasticNMoveMultiMoveGenerator()
|
---|
50 | : base() {
|
---|
51 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator that should be used."));
|
---|
52 | Parameters.Add(new LookupParameter<DoubleArray>("Capacities", GeneralizedQuadraticAssignmentProblem.CapacitiesDescription));
|
---|
53 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
54 | }
|
---|
55 |
|
---|
56 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
57 | return new StochasticNMoveMultiMoveGenerator(this, cloner);
|
---|
58 | }
|
---|
59 |
|
---|
60 | public static IEnumerable<NMove> Generate(IRandom random, IntegerVector assignment, int n, DoubleArray capacities, int sampleSize) {
|
---|
61 | for (int i = 0; i < sampleSize; i++)
|
---|
62 | yield return StochasticNMoveSingleMoveGenerator.GenerateUpToN(random, assignment, n, capacities);
|
---|
63 | }
|
---|
64 |
|
---|
65 | public override IEnumerable<NMove> GenerateMoves(IntegerVector assignment, int n) {
|
---|
66 | return Generate(RandomParameter.ActualValue, assignment, n, CapacitiesParameter.ActualValue, SampleSizeParameter.ActualValue.Value);
|
---|
67 | }
|
---|
68 | }
|
---|
69 | }
|
---|