| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 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 HeuristicLab.Common;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Optimization.Operators;
|
|---|
| 25 | using HeuristicLab.Parameters;
|
|---|
| 26 | using HEAL.Attic;
|
|---|
| 27 |
|
|---|
| 28 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
|---|
| 29 | [Item("Swap2MoveTabuMaker", "Declares a given swap-2 move as tabu, by adding its attributes to the tabu list and also store the solution quality or the move quality (whichever is better).")]
|
|---|
| 30 | [StorableType("A6548572-AF42-46FF-9B8C-E00EB9B92DE4")]
|
|---|
| 31 | public class Swap2MoveTabuMaker : TabuMaker, IPermutationSwap2MoveOperator {
|
|---|
| 32 | public ILookupParameter<Permutation> PermutationParameter {
|
|---|
| 33 | get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
|
|---|
| 34 | }
|
|---|
| 35 | public ILookupParameter<Swap2Move> Swap2MoveParameter {
|
|---|
| 36 | get { return (LookupParameter<Swap2Move>)Parameters["Swap2Move"]; }
|
|---|
| 37 | }
|
|---|
| 38 |
|
|---|
| 39 | [StorableConstructor]
|
|---|
| 40 | protected Swap2MoveTabuMaker(StorableConstructorFlag _) : base(_) { }
|
|---|
| 41 | protected Swap2MoveTabuMaker(Swap2MoveTabuMaker original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 42 | public Swap2MoveTabuMaker()
|
|---|
| 43 | : base() {
|
|---|
| 44 | Parameters.Add(new LookupParameter<Swap2Move>("Swap2Move", "The move that was made."));
|
|---|
| 45 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
|
|---|
| 46 | }
|
|---|
| 47 |
|
|---|
| 48 | public override IDeepCloneable Clone(Cloner cloner) {
|
|---|
| 49 | return new Swap2MoveTabuMaker(this, cloner);
|
|---|
| 50 | }
|
|---|
| 51 |
|
|---|
| 52 | protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
|
|---|
| 53 | Swap2Move move = Swap2MoveParameter.ActualValue;
|
|---|
| 54 | Permutation permutation = PermutationParameter.ActualValue;
|
|---|
| 55 | double baseQuality = moveQuality;
|
|---|
| 56 | if (maximization && quality > moveQuality || !maximization && quality < moveQuality) baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
|
|---|
| 57 | if (permutation.PermutationType == PermutationTypes.Absolute)
|
|---|
| 58 | return new Swap2MoveAbsoluteAttribute(move.Index1, permutation[move.Index1], move.Index2, permutation[move.Index2], baseQuality);
|
|---|
| 59 | else {
|
|---|
| 60 | Swap2MoveRelativeAttribute attrib = new Swap2MoveRelativeAttribute(baseQuality);
|
|---|
| 61 | bool bidirectional = permutation.PermutationType == PermutationTypes.RelativeUndirected;
|
|---|
| 62 | attrib.DeletedEdges.Add(new Edge(permutation.GetCircular(move.Index1 - 1), permutation[move.Index1], bidirectional));
|
|---|
| 63 | attrib.DeletedEdges.Add(new Edge(permutation[move.Index1], permutation.GetCircular(move.Index1 + 1), bidirectional));
|
|---|
| 64 | attrib.DeletedEdges.Add(new Edge(permutation.GetCircular(move.Index2 - 1), permutation[move.Index2], bidirectional));
|
|---|
| 65 | attrib.DeletedEdges.Add(new Edge(permutation[move.Index2], permutation.GetCircular(move.Index2 + 1), bidirectional));
|
|---|
| 66 | attrib.AddedEdges.Add(new Edge(permutation.GetCircular(move.Index1 - 1), permutation[move.Index2], bidirectional));
|
|---|
| 67 | attrib.AddedEdges.Add(new Edge(permutation[move.Index2], permutation.GetCircular(move.Index1 + 1), bidirectional));
|
|---|
| 68 | attrib.AddedEdges.Add(new Edge(permutation.GetCircular(move.Index2 - 1), permutation[move.Index1], bidirectional));
|
|---|
| 69 | attrib.AddedEdges.Add(new Edge(permutation[move.Index1], permutation.GetCircular(move.Index2 + 1), bidirectional));
|
|---|
| 70 | return attrib;
|
|---|
| 71 | }
|
|---|
| 72 | }
|
|---|
| 73 | }
|
|---|
| 74 | }
|
|---|
