source: branches/GeneralizedQAP/HeuristicLab.Problems.GeneralizedQuadraticAssignment/3.3/Moves/StochasticNMoveSingleMoveGenerator.cs @ 7505

Last change on this file since 7505 was 7505, checked in by abeham, 8 years ago

#1614

  • added instances of Cordeau et al. as given by L. Moccia
  • added operators for tabu search
File size: 3.5 KB
Line 
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
22using System.Collections.Generic;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Encodings.IntegerVectorEncoding;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
32  [Item("Stochastic N-Move SingleMoveGenerator", "Randomly samples a single N-Move.")]
33  [StorableClass]
34  public class StochasticNMoveSingleMoveGenerator : GQAPNMoveGenerator, ICapacitiesAwareGQAPOperator, IStochasticOperator, ISingleMoveGenerator {
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
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      Parameters.Add(new LookupParameter<DoubleArray>("Capacities", GeneralizedQuadraticAssignmentProblem.CapacitiesDescription));
50    }
51
52    public override IDeepCloneable Clone(Cloner cloner) {
53      return new StochasticNMoveSingleMoveGenerator(this, cloner);
54    }
55
56    public static NMove GenerateUpToN(IRandom random, IntegerVector assignment, int n, DoubleArray capacities) {
57      return GenerateExactlyN(random, assignment, random.Next(n) + 1, capacities);
58    }
59
60    public static NMove GenerateExactlyN(IRandom random, IntegerVector assignment, int n, DoubleArray capacities) {
61      int[] equipments = new int[n], locations = new int[n];
62      HashSet<int> chosenEquipments = new HashSet<int>();
63      for (int i = 0; i < n; i++) {
64        do {
65          equipments[i] = random.Next(assignment.Length);
66        } while (chosenEquipments.Contains(equipments[i]));
67        chosenEquipments.Add(equipments[i]);
68        do {
69          locations[i] = random.Next(capacities.Length);
70        } while (locations[i] == assignment[equipments[i]]);
71      }
72      return new NMove(equipments, locations);
73    }
74
75    public override IEnumerable<NMove> GenerateMoves(IntegerVector assignment, int n) {
76      yield return GenerateUpToN(RandomParameter.ActualValue, assignment, n, CapacitiesParameter.ActualValue);
77    }
78  }
79}
Note: See TracBrowser for help on using the repository browser.