[7319] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15504] | 3 | * Copyright (C) 2002-2017 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7319] | 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.Linq;
|
---|
| 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Encodings.IntegerVectorEncoding;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
|
---|
| 30 |
|
---|
| 31 | [Item("SwapLocationManipluator", "Swaps two locations by exchanging all equipments between the locations.")]
|
---|
| 32 | [StorableClass]
|
---|
[15504] | 33 | public class SwapLocationManipluator : GQAPManipulator {
|
---|
| 34 |
|
---|
[7319] | 35 | [StorableConstructor]
|
---|
| 36 | protected SwapLocationManipluator(bool deserializing) : base(deserializing) { }
|
---|
| 37 | protected SwapLocationManipluator(SwapLocationManipluator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 38 | public SwapLocationManipluator()
|
---|
| 39 | : base() {
|
---|
| 40 | }
|
---|
| 41 |
|
---|
| 42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 43 | return new SwapLocationManipluator(this, cloner);
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 | public static void Apply(IRandom random, IntegerVector assignment, int locations) {
|
---|
| 47 | if (assignment.Length < 2) throw new InvalidOperationException("Vector is too small for swap operation.");
|
---|
| 48 | var groupedLocations = assignment
|
---|
| 49 | .Select((value, index) => new { Index = index, Value = value })
|
---|
| 50 | .GroupBy(x => x.Value)
|
---|
| 51 | .ToDictionary(x => x.Key, y => y.AsEnumerable());
|
---|
| 52 | if (locations < 2) throw new InvalidOperationException("There doesn't exist more than one location.");
|
---|
| 53 |
|
---|
| 54 | int location1 = random.Next(locations), location2 = random.Next(locations);
|
---|
| 55 | while (location1 == location2) location2 = random.Next(locations);
|
---|
| 56 |
|
---|
| 57 | if (groupedLocations.ContainsKey(location1)) {
|
---|
| 58 | foreach (var index in groupedLocations[location1])
|
---|
| 59 | assignment[index.Index] = location2;
|
---|
| 60 | }
|
---|
| 61 | if (groupedLocations.ContainsKey(location2)) {
|
---|
| 62 | foreach (var index in groupedLocations[location2])
|
---|
| 63 | assignment[index.Index] = location1;
|
---|
| 64 | }
|
---|
| 65 | }
|
---|
| 66 |
|
---|
[15504] | 67 | protected override void Manipulate(IRandom random, IntegerVector vector, GQAPInstance problemInstance) {
|
---|
| 68 | Apply(random, vector, problemInstance.Capacities.Length);
|
---|
[7319] | 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|