[9563] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[13032] | 3 | * Copyright (C) 2002-2015 Joseph Helm and Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[9563] | 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 |
|
---|
[13032] | 22 |
|
---|
[9563] | 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;
|
---|
[14046] | 30 | using HeuristicLab.Problems.BinPacking;
|
---|
[9563] | 31 |
|
---|
[14046] | 32 |
|
---|
[9563] | 33 | namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
|
---|
| 34 | [Item("SequenceMoveSoftTabuCriterion", "<Missing>")]
|
---|
| 35 | [StorableClass]
|
---|
| 36 | public class SequenceMoveSoftTabuCriterion : SingleSuccessorOperator, IPackingSequenceMoveOperator, ITabuChecker {
|
---|
| 37 | public override bool CanChangeName {
|
---|
| 38 | get { return false; }
|
---|
| 39 | }
|
---|
| 40 | public ILookupParameter<IPackingMove> PackingMoveParameter {
|
---|
| 41 | get { return (ILookupParameter<IPackingMove>)Parameters["PackingMove"]; }
|
---|
| 42 | }
|
---|
| 43 | public ILookupParameter<PackingSequenceEncoding> PackingSequenceParameter {
|
---|
| 44 | get { return (ILookupParameter<PackingSequenceEncoding>)Parameters["PackingSequence"]; }
|
---|
| 45 | }
|
---|
| 46 | public ILookupParameter<ItemList<IItem>> TabuListParameter {
|
---|
| 47 | get { return (ILookupParameter<ItemList<IItem>>)Parameters["TabuList"]; }
|
---|
| 48 | }
|
---|
| 49 | public ILookupParameter<BoolValue> MoveTabuParameter {
|
---|
| 50 | get { return (ILookupParameter<BoolValue>)Parameters["MoveTabu"]; }
|
---|
| 51 | }
|
---|
| 52 | public IValueLookupParameter<BoolValue> MaximizationParameter {
|
---|
| 53 | get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
---|
| 54 | }
|
---|
| 55 | public ILookupParameter<DoubleValue> MoveQualityParameter {
|
---|
| 56 | get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
|
---|
| 57 | }
|
---|
| 58 | public ValueParameter<BoolValue> UseAspirationCriterionParameter {
|
---|
| 59 | get { return (ValueParameter<BoolValue>)Parameters["UseAspirationCriterion"]; }
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | [StorableConstructor]
|
---|
| 63 | protected SequenceMoveSoftTabuCriterion(bool deserializing) : base(deserializing) { }
|
---|
| 64 | protected SequenceMoveSoftTabuCriterion(SequenceMoveSoftTabuCriterion original, Cloner cloner) : base(original, cloner) { }
|
---|
| 65 | public SequenceMoveSoftTabuCriterion()
|
---|
| 66 | : base() {
|
---|
| 67 | Parameters.Add(new LookupParameter<IPackingMove>("PackingMove", "The move to evaluate."));
|
---|
| 68 | Parameters.Add(new LookupParameter<PackingSequenceEncoding>("PackingSequence", "The solution to evaluate."));
|
---|
| 69 | Parameters.Add(new LookupParameter<BoolValue>("MoveTabu", "The variable to store if a move was tabu."));
|
---|
| 70 | Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list."));
|
---|
| 71 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, else if it is a minimization problem."));
|
---|
| 72 | Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The quality of the current move."));
|
---|
| 73 | Parameters.Add(new ValueParameter<BoolValue>("UseAspirationCriterion", "Whether to use the aspiration criterion or not.", new BoolValue(true)));
|
---|
| 74 | }
|
---|
| 75 |
|
---|
| 76 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 77 | return new SequenceMoveSoftTabuCriterion(this, cloner);
|
---|
| 78 | }
|
---|
| 79 |
|
---|
| 80 | public override IOperation Apply() {
|
---|
| 81 | ItemList<IItem> tabuList = TabuListParameter.ActualValue;
|
---|
| 82 | SequenceMove move = PackingMoveParameter.ActualValue as SequenceMove;
|
---|
| 83 | PackingSequenceEncoding PackingSequence = PackingSequenceParameter.ActualValue;
|
---|
| 84 | int length = PackingSequence.PackingSequence.Length;
|
---|
| 85 | double moveQuality = MoveQualityParameter.ActualValue.Value;
|
---|
| 86 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
| 87 | bool useAspiration = UseAspirationCriterionParameter.Value.Value;
|
---|
| 88 | bool isTabu = IsMoveTabu(tabuList, move, PackingSequence, moveQuality, maximization, useAspiration);
|
---|
| 89 |
|
---|
| 90 | MoveTabuParameter.ActualValue = new BoolValue(isTabu);
|
---|
| 91 | return base.Apply();
|
---|
| 92 | }
|
---|
| 93 |
|
---|
| 94 | private bool IsMoveTabu(ItemList<IItem> tabuList, SequenceMove move, PackingSequenceEncoding PackingSequence, double moveQuality, bool maximization, bool useAspiration) {
|
---|
| 95 | bool isTabu = false;
|
---|
| 96 | var attributes = tabuList.FindAll(ta => ta.GetType().Equals(move.GetMoveAttributeType()));
|
---|
| 97 |
|
---|
| 98 | foreach (IItem attr in attributes) {
|
---|
| 99 | SequenceMoveAttribute gvAttr = attr as SequenceMoveAttribute;
|
---|
| 100 | if (gvAttr != null
|
---|
| 101 | && (!useAspiration
|
---|
| 102 | || maximization && moveQuality <= gvAttr.MoveQuality
|
---|
| 103 | || !maximization && moveQuality >= gvAttr.MoveQuality)) {
|
---|
| 104 |
|
---|
| 105 | isTabu = move.BelongsToAttribute(gvAttr, false);
|
---|
| 106 | }
|
---|
| 107 | if (isTabu) break;
|
---|
| 108 | }
|
---|
| 109 |
|
---|
| 110 | return isTabu;
|
---|
| 111 | }
|
---|
| 112 | }
|
---|
| 113 | }
|
---|