[3117] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3117] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[3117] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
[17097] | 28 | using HEAL.Attic;
|
---|
[3117] | 29 |
|
---|
| 30 | namespace HeuristicLab.Encodings.BinaryVectorEncoding {
|
---|
[3340] | 31 | [Item("OneBitflipMoveTabuChecker", "Prevents peforming a one bitflip move again.")]
|
---|
[17097] | 32 | [StorableType("27523531-D19E-47ED-9397-F7457D41B85B")]
|
---|
[3340] | 33 | public class OneBitflipMoveTabuChecker : SingleSuccessorOperator, IOneBitflipMoveOperator, ITabuChecker {
|
---|
[3520] | 34 | public override bool CanChangeName {
|
---|
| 35 | get { return false; }
|
---|
| 36 | }
|
---|
[3117] | 37 | public ILookupParameter<OneBitflipMove> OneBitflipMoveParameter {
|
---|
| 38 | get { return (LookupParameter<OneBitflipMove>)Parameters["OneBitflipMove"]; }
|
---|
| 39 | }
|
---|
| 40 | public ILookupParameter<BinaryVector> BinaryVectorParameter {
|
---|
| 41 | get { return (LookupParameter<BinaryVector>)Parameters["BinaryVector"]; }
|
---|
[4068] | 42 | }
|
---|
[3117] | 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 | }
|
---|
[3340] | 49 | public IValueLookupParameter<BoolValue> MaximizationParameter {
|
---|
| 50 | get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
---|
[3117] | 51 | }
|
---|
[3340] | 52 | public ILookupParameter<DoubleValue> MoveQualityParameter {
|
---|
| 53 | get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
|
---|
| 54 | }
|
---|
| 55 | public ValueParameter<BoolValue> UseAspirationCriterionParameter {
|
---|
| 56 | get { return (ValueParameter<BoolValue>)Parameters["UseAspirationCriterion"]; }
|
---|
| 57 | }
|
---|
[3117] | 58 |
|
---|
[3340] | 59 | public BoolValue UseAspirationCriterion {
|
---|
| 60 | get { return UseAspirationCriterionParameter.Value; }
|
---|
| 61 | set { UseAspirationCriterionParameter.Value = value; }
|
---|
| 62 | }
|
---|
| 63 |
|
---|
[4722] | 64 | [StorableConstructor]
|
---|
[17097] | 65 | protected OneBitflipMoveTabuChecker(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 66 | protected OneBitflipMoveTabuChecker(OneBitflipMoveTabuChecker original, Cloner cloner) : base(original, cloner) { }
|
---|
[3340] | 67 | public OneBitflipMoveTabuChecker()
|
---|
[3117] | 68 | : base() {
|
---|
| 69 | Parameters.Add(new LookupParameter<OneBitflipMove>("OneBitflipMove", "The move to evaluate."));
|
---|
| 70 | Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
|
---|
| 71 | Parameters.Add(new LookupParameter<BinaryVector>("BinaryVector", "The solution as permutation."));
|
---|
| 72 | Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
|
---|
[3340] | 73 | Parameters.Add(new ValueParameter<BoolValue>("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true)));
|
---|
| 74 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem."));
|
---|
| 75 | Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The quality of the current move."));
|
---|
[3117] | 76 | }
|
---|
| 77 |
|
---|
[4722] | 78 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 79 | return new OneBitflipMoveTabuChecker(this, cloner);
|
---|
| 80 | }
|
---|
| 81 |
|
---|
[3117] | 82 | public override IOperation Apply() {
|
---|
| 83 | ItemList<IItem> tabuList = TabuListParameter.ActualValue;
|
---|
| 84 | OneBitflipMove move = OneBitflipMoveParameter.ActualValue;
|
---|
[3340] | 85 | double moveQuality = MoveQualityParameter.ActualValue.Value;
|
---|
| 86 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
| 87 | bool useAspiration = UseAspirationCriterion.Value;
|
---|
[3117] | 88 | bool isTabu = false;
|
---|
| 89 | foreach (IItem tabuMove in tabuList) {
|
---|
[3340] | 90 | OneBitflipMoveAttribute attribute = (tabuMove as OneBitflipMoveAttribute);
|
---|
[3117] | 91 | if (attribute != null) {
|
---|
[3340] | 92 | if (!useAspiration
|
---|
| 93 | || maximization && moveQuality <= attribute.MoveQuality
|
---|
| 94 | || !maximization && moveQuality >= attribute.MoveQuality) {
|
---|
| 95 | if (attribute.Index == move.Index) {
|
---|
| 96 | isTabu = true;
|
---|
| 97 | break;
|
---|
| 98 | }
|
---|
[3117] | 99 | }
|
---|
| 100 | }
|
---|
| 101 | }
|
---|
| 102 | MoveTabuParameter.ActualValue = new BoolValue(isTabu);
|
---|
| 103 | return base.Apply();
|
---|
| 104 | }
|
---|
| 105 | }
|
---|
| 106 | }
|
---|