| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2017 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.Encodings.IntegerVectorEncoding;
|
|---|
| 25 | using HeuristicLab.Optimization.Operators;
|
|---|
| 26 | using HeuristicLab.Parameters;
|
|---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 28 |
|
|---|
| 29 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment.Moves {
|
|---|
| 30 | [Item("N-Move TabuMaker", "Declares an N-Move tabu.")]
|
|---|
| 31 | [StorableClass]
|
|---|
| 32 | public class NMoveTabuMaker : TabuMaker, IGQAPNMoveOperator, IMoveQualityAwareGQAPOperator {
|
|---|
| 33 |
|
|---|
| 34 | public ILookupParameter<IntegerVector> AssignmentParameter {
|
|---|
| 35 | get { return (ILookupParameter<IntegerVector>)Parameters["Assignment"]; }
|
|---|
| 36 | }
|
|---|
| 37 | public ILookupParameter<NMove> MoveParameter {
|
|---|
| 38 | get { return (ILookupParameter<NMove>)Parameters["Move"]; }
|
|---|
| 39 | }
|
|---|
| 40 | public ILookupParameter<Evaluation> MoveEvaluationParameter {
|
|---|
| 41 | get { return (ILookupParameter<Evaluation>)Parameters["MoveEvaluation"]; }
|
|---|
| 42 | }
|
|---|
| 43 |
|
|---|
| 44 | [StorableConstructor]
|
|---|
| 45 | protected NMoveTabuMaker(bool deserializing) : base(deserializing) { }
|
|---|
| 46 | protected NMoveTabuMaker(NMoveTabuMaker original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 47 | public NMoveTabuMaker()
|
|---|
| 48 | : base() {
|
|---|
| 49 | Parameters.Add(new LookupParameter<IntegerVector>("Assignment", GQAPSolutionCreator.AssignmentDescription));
|
|---|
| 50 | Parameters.Add(new LookupParameter<NMove>("Move", GQAPNMoveGenerator.MoveDescription));
|
|---|
| 51 | Parameters.Add(new LookupParameter<Evaluation>("MoveEvaluation", GQAPNMoveEvaluator.MoveEvaluationDescription));
|
|---|
| 52 | }
|
|---|
| 53 |
|
|---|
| 54 | public override IDeepCloneable Clone(Cloner cloner) {
|
|---|
| 55 | return new NMoveTabuMaker(this, cloner);
|
|---|
| 56 | }
|
|---|
| 57 |
|
|---|
| 58 | protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
|
|---|
| 59 | var move = MoveParameter.ActualValue;
|
|---|
| 60 | var assignment = AssignmentParameter.ActualValue;
|
|---|
| 61 | double baseQuality = moveQuality;
|
|---|
| 62 | if (maximization && quality > moveQuality || !maximization && quality < moveQuality) baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
|
|---|
| 63 | return new NMoveAbsoluteTabuAttribute(move, assignment, baseQuality);
|
|---|
| 64 | }
|
|---|
| 65 | }
|
|---|
| 66 | }
|
|---|
