| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2010 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 HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Operators;
|
|---|
| 26 | using HeuristicLab.Optimization;
|
|---|
| 27 | using HeuristicLab.Parameters;
|
|---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 29 |
|
|---|
| 30 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
|---|
| 31 | [Item("TwoOptPreventEdgeReadding", "Prevents readding of previously deleted edges, but allows deleting previously added edges.")]
|
|---|
| 32 | [StorableClass]
|
|---|
| 33 | public class PreventReaddTwoOptTabuMoveEvaluator : SingleSuccessorOperator, ITwoOptPermutationMoveOperator, ITabuMoveEvaluator {
|
|---|
| 34 | public override bool CanChangeName {
|
|---|
| 35 | get { return false; }
|
|---|
| 36 | }
|
|---|
| 37 | public ILookupParameter<TwoOptMove> TwoOptMoveParameter {
|
|---|
| 38 | get { return (LookupParameter<TwoOptMove>)Parameters["TwoOptMove"]; }
|
|---|
| 39 | }
|
|---|
| 40 | public ILookupParameter<Permutation> PermutationParameter {
|
|---|
| 41 | get { return (LookupParameter<Permutation>)Parameters["Permutation"]; }
|
|---|
| 42 | }
|
|---|
| 43 | public ILookupParameter<ItemList<IItem>> TabuListParameter {
|
|---|
| 44 | get { return (ILookupParameter<ItemList<IItem>>)Parameters["TabuList"]; }
|
|---|
| 45 | }
|
|---|
| 46 | public ILookupParameter<BoolValue> MoveTabuParameter {
|
|---|
| 47 | get { return (ILookupParameter<BoolValue>)Parameters["MoveTabu"]; }
|
|---|
| 48 | }
|
|---|
| 49 | private ScopeParameter CurrentScopeParameter {
|
|---|
| 50 | get { return (ScopeParameter)Parameters["CurrentScope"]; }
|
|---|
| 51 | }
|
|---|
| 52 |
|
|---|
| 53 | public PreventReaddTwoOptTabuMoveEvaluator()
|
|---|
| 54 | : base() {
|
|---|
| 55 | Parameters.Add(new LookupParameter<TwoOptMove>("TwoOptMove", "The move to evaluate."));
|
|---|
| 56 | Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
|
|---|
| 57 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
|
|---|
| 58 | Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
|
|---|
| 59 | Parameters.Add(new ScopeParameter("CurrentScope", "The current scope."));
|
|---|
| 60 | }
|
|---|
| 61 |
|
|---|
| 62 | public override IOperation Apply() {
|
|---|
| 63 | ItemList<IItem> tabuList = TabuListParameter.ActualValue;
|
|---|
| 64 | TwoOptMove move = TwoOptMoveParameter.ActualValue;
|
|---|
| 65 | Permutation permutation = PermutationParameter.ActualValue;
|
|---|
| 66 | int length = permutation.Length;
|
|---|
| 67 | int E1S = permutation.GetCircular(move.Index1 - 1);
|
|---|
| 68 | int E1T = permutation[move.Index1];
|
|---|
| 69 | int E2S = permutation[move.Index2];
|
|---|
| 70 | int E2T = permutation.GetCircular(move.Index2 + 1);
|
|---|
| 71 | bool isTabu = (move.Index2 - move.Index1 >= length - 2); // doesn't change the solution;
|
|---|
| 72 | if (!isTabu) {
|
|---|
| 73 | foreach (IItem tabuMove in tabuList) {
|
|---|
| 74 | TwoOptTabuMoveAttribute attribute = (tabuMove as TwoOptTabuMoveAttribute);
|
|---|
| 75 | if (attribute != null) {
|
|---|
| 76 | // if previously deleted Edge1Source-Target is readded
|
|---|
| 77 | if (attribute.Edge1Source == E1S && attribute.Edge1Target == E2S || attribute.Edge1Source == E2S && attribute.Edge1Target == E1S
|
|---|
| 78 | || attribute.Edge1Source == E1T && attribute.Edge1Target == E2T || attribute.Edge1Source == E2T && attribute.Edge1Target == E1T
|
|---|
| 79 | // if previously deleted Edge2Source-Target is readded
|
|---|
| 80 | || attribute.Edge2Source == E1T && attribute.Edge2Target == E2T || attribute.Edge2Source == E2T && attribute.Edge2Target == E1T
|
|---|
| 81 | || attribute.Edge2Source == E1S && attribute.Edge2Target == E2S || attribute.Edge2Source == E2S && attribute.Edge2Target == E1S) {
|
|---|
| 82 | isTabu = true;
|
|---|
| 83 | break;
|
|---|
| 84 | }
|
|---|
| 85 | }
|
|---|
| 86 | }
|
|---|
| 87 | }
|
|---|
| 88 | MoveTabuParameter.ActualValue = new BoolValue(isTabu);
|
|---|
| 89 | return base.Apply();
|
|---|
| 90 | }
|
|---|
| 91 | }
|
|---|
| 92 | }
|
|---|
