1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2017 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.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Data;
|
---|
28 | using HeuristicLab.Encodings.IntegerVectorEncoding;
|
---|
29 | using HeuristicLab.Optimization;
|
---|
30 | using HeuristicLab.Parameters;
|
---|
31 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
32 | using HeuristicLab.Random;
|
---|
33 |
|
---|
34 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
|
---|
35 | [Item("Stochastic N-Move SingleMoveGenerator", "Randomly samples a single N-Move.")]
|
---|
36 | [StorableClass]
|
---|
37 | public class StochasticNMoveSingleMoveGenerator : GQAPNMoveGenerator, IStochasticOperator, ISingleMoveGenerator {
|
---|
38 |
|
---|
39 | public ILookupParameter<IRandom> RandomParameter {
|
---|
40 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
41 | }
|
---|
42 |
|
---|
43 | [StorableConstructor]
|
---|
44 | protected StochasticNMoveSingleMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
45 | protected StochasticNMoveSingleMoveGenerator(StochasticNMoveSingleMoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
46 | public StochasticNMoveSingleMoveGenerator()
|
---|
47 | : base() {
|
---|
48 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator that should be used."));
|
---|
49 | }
|
---|
50 |
|
---|
51 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
52 | return new StochasticNMoveSingleMoveGenerator(this, cloner);
|
---|
53 | }
|
---|
54 |
|
---|
55 | public static NMove GenerateUpToN(IRandom random, IntegerVector assignment, int n, DoubleArray capacities) {
|
---|
56 | return GenerateExactlyN(random, assignment, random.Next(n) + 1, capacities);
|
---|
57 | }
|
---|
58 |
|
---|
59 | public static NMove GenerateExactlyN(IRandom random, IntegerVector assignment, int n, DoubleArray capacities) {
|
---|
60 | if (capacities.Length <= 1) throw new ArgumentException("There must be at least two locations.");
|
---|
61 | var dim = assignment.Length;
|
---|
62 | var reassignment = new int[dim];
|
---|
63 | var equipments = Enumerable.Range(0, dim).SampleRandomWithoutRepetition(random, n, dim).ToList();
|
---|
64 | for (var i = 0; i < n; i++) {
|
---|
65 | var equip = equipments[i];
|
---|
66 | do {
|
---|
67 | reassignment[equip] = random.Next(capacities.Length) + 1;
|
---|
68 | } while (reassignment[equip] == assignment[equip] + 1);
|
---|
69 | }
|
---|
70 | return new NMove(reassignment, equipments);
|
---|
71 | }
|
---|
72 |
|
---|
73 | public override IEnumerable<NMove> GenerateMoves(IntegerVector assignment, int n, GQAPInstance problemInstance) {
|
---|
74 | yield return GenerateUpToN(RandomParameter.ActualValue, assignment, n, problemInstance.Capacities);
|
---|
75 | }
|
---|
76 | }
|
---|
77 | }
|
---|