source: branches/GeneralizedQAP/HeuristicLab.Problems.GeneralizedQuadraticAssignment/3.3/Operators/Manipulators/SwapLocationManipulator.cs @ 7523

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

#1614

  • sorted operators
  • added crossover defined by Cordeau et al.
  • fixed a few bugs
File size: 3.2 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;
23using System.Linq;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Encodings.IntegerVectorEncoding;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
32
33  [Item("SwapLocationManipluator", "Swaps two locations by exchanging all equipments between the locations.")]
34  [StorableClass]
35  public class SwapLocationManipluator : GQAPManipulator, ICapacitiesAwareGQAPOperator {
36
37    public ILookupParameter<DoubleArray> CapacitiesParameter {
38      get { return (ILookupParameter<DoubleArray>)Parameters["Capacities"]; }
39    }
40
41    [StorableConstructor]
42    protected SwapLocationManipluator(bool deserializing) : base(deserializing) { }
43    protected SwapLocationManipluator(SwapLocationManipluator original, Cloner cloner) : base(original, cloner) { }
44    public SwapLocationManipluator()
45      : base() {
46      Parameters.Add(new LookupParameter<DoubleArray>("Capacities", GeneralizedQuadraticAssignmentProblem.CapacitiesDescription));
47    }
48
49    public override IDeepCloneable Clone(Cloner cloner) {
50      return new SwapLocationManipluator(this, cloner);
51    }
52
53    public static void Apply(IRandom random, IntegerVector assignment, int locations) {
54      if (assignment.Length < 2) throw new InvalidOperationException("Vector is too small for swap operation.");
55      var groupedLocations = assignment
56        .Select((value, index) => new { Index = index, Value = value })
57        .GroupBy(x => x.Value)
58        .ToDictionary(x => x.Key, y => y.AsEnumerable());
59      if (locations < 2) throw new InvalidOperationException("There doesn't exist more than one location.");
60
61      int location1 = random.Next(locations), location2 = random.Next(locations);
62      while (location1 == location2) location2 = random.Next(locations);
63
64      if (groupedLocations.ContainsKey(location1)) {
65        foreach (var index in groupedLocations[location1])
66          assignment[index.Index] = location2;
67      }
68      if (groupedLocations.ContainsKey(location2)) {
69        foreach (var index in groupedLocations[location2])
70          assignment[index.Index] = location1;
71      }
72    }
73
74    protected override void Manipulate(IRandom random, IntegerVector vector) {
75      Apply(random, vector, CapacitiesParameter.ActualValue.Length);
76    }
77  }
78}
Note: See TracBrowser for help on using the repository browser.