| 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.Common;
|
|---|
| 24 | using HeuristicLab.Core;
|
|---|
| 25 | using HeuristicLab.Data;
|
|---|
| 26 | using HeuristicLab.Operators;
|
|---|
| 27 | using HeuristicLab.Optimization;
|
|---|
| 28 | using HeuristicLab.Parameters;
|
|---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 30 |
|
|---|
| 31 | namespace HeuristicLab.Encodings.BinaryVectorEncoding {
|
|---|
| 32 | [Item("OneBitflipMoveTabuChecker", "Prevents peforming a one bitflip move again.")]
|
|---|
| 33 | [StorableClass]
|
|---|
| 34 | public class OneBitflipMoveTabuChecker : SingleSuccessorOperator, IOneBitflipMoveOperator, ITabuChecker {
|
|---|
| 35 | public override bool CanChangeName {
|
|---|
| 36 | get { return false; }
|
|---|
| 37 | }
|
|---|
| 38 | public ILookupParameter<OneBitflipMove> OneBitflipMoveParameter {
|
|---|
| 39 | get { return (LookupParameter<OneBitflipMove>)Parameters["OneBitflipMove"]; }
|
|---|
| 40 | }
|
|---|
| 41 | public ILookupParameter<BinaryVector> BinaryVectorParameter {
|
|---|
| 42 | get { return (LookupParameter<BinaryVector>)Parameters["BinaryVector"]; }
|
|---|
| 43 | }
|
|---|
| 44 | public ILookupParameter<ItemList<IItem>> TabuListParameter {
|
|---|
| 45 | get { return (ILookupParameter<ItemList<IItem>>)Parameters["TabuList"]; }
|
|---|
| 46 | }
|
|---|
| 47 | public ILookupParameter<BoolValue> MoveTabuParameter {
|
|---|
| 48 | get { return (ILookupParameter<BoolValue>)Parameters["MoveTabu"]; }
|
|---|
| 49 | }
|
|---|
| 50 | public IValueLookupParameter<BoolValue> MaximizationParameter {
|
|---|
| 51 | get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
|---|
| 52 | }
|
|---|
| 53 | public ILookupParameter<DoubleValue> MoveQualityParameter {
|
|---|
| 54 | get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
|
|---|
| 55 | }
|
|---|
| 56 | public ValueParameter<BoolValue> UseAspirationCriterionParameter {
|
|---|
| 57 | get { return (ValueParameter<BoolValue>)Parameters["UseAspirationCriterion"]; }
|
|---|
| 58 | }
|
|---|
| 59 |
|
|---|
| 60 | public BoolValue UseAspirationCriterion {
|
|---|
| 61 | get { return UseAspirationCriterionParameter.Value; }
|
|---|
| 62 | set { UseAspirationCriterionParameter.Value = value; }
|
|---|
| 63 | }
|
|---|
| 64 |
|
|---|
| 65 | public OneBitflipMoveTabuChecker()
|
|---|
| 66 | : base() {
|
|---|
| 67 | Parameters.Add(new LookupParameter<OneBitflipMove>("OneBitflipMove", "The move to evaluate."));
|
|---|
| 68 | Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
|
|---|
| 69 | Parameters.Add(new LookupParameter<BinaryVector>("BinaryVector", "The solution as permutation."));
|
|---|
| 70 | Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
|
|---|
| 71 | Parameters.Add(new ValueParameter<BoolValue>("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true)));
|
|---|
| 72 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem."));
|
|---|
| 73 | Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The quality of the current move."));
|
|---|
| 74 | }
|
|---|
| 75 |
|
|---|
| 76 | public override IOperation Apply() {
|
|---|
| 77 | ItemList<IItem> tabuList = TabuListParameter.ActualValue;
|
|---|
| 78 | OneBitflipMove move = OneBitflipMoveParameter.ActualValue;
|
|---|
| 79 | double moveQuality = MoveQualityParameter.ActualValue.Value;
|
|---|
| 80 | bool maximization = MaximizationParameter.ActualValue.Value;
|
|---|
| 81 | bool useAspiration = UseAspirationCriterion.Value;
|
|---|
| 82 | bool isTabu = false;
|
|---|
| 83 | foreach (IItem tabuMove in tabuList) {
|
|---|
| 84 | OneBitflipMoveAttribute attribute = (tabuMove as OneBitflipMoveAttribute);
|
|---|
| 85 | if (attribute != null) {
|
|---|
| 86 | if (!useAspiration
|
|---|
| 87 | || maximization && moveQuality <= attribute.MoveQuality
|
|---|
| 88 | || !maximization && moveQuality >= attribute.MoveQuality) {
|
|---|
| 89 | if (attribute.Index == move.Index) {
|
|---|
| 90 | isTabu = true;
|
|---|
| 91 | break;
|
|---|
| 92 | }
|
|---|
| 93 | }
|
|---|
| 94 | }
|
|---|
| 95 | }
|
|---|
| 96 | MoveTabuParameter.ActualValue = new BoolValue(isTabu);
|
|---|
| 97 | return base.Apply();
|
|---|
| 98 | }
|
|---|
| 99 | }
|
|---|
| 100 | }
|
|---|
