Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2708_ScopedAlgorithms/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveTabuMaker.cs @ 16752

Last change on this file since 16752 was 13396, checked in by abeham, 9 years ago

#2521:

  • Refactored QuadraticAssignmentProblem to use new SingleObjectiveProblem
    • Removed QAPEvaluator
    • Adapted RobustTabooSearch
  • Introduced several interfaces in PermutationEncoding necessary for wiring
  • Changed all Encodings to use IItem instead of IOperator in ConfigureOperators (name still unchanged)
  • Added a protected MaximizationParameter property in SingleObjectiveProblem (necessary for wiring)
  • Changed AlleleFrequnencyAnalyzer to use ISolution interface instead of IItem
  • Added a comment to ISolutionCreator<TSolution> of some changes that would be welcomed
File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Optimization.Operators;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Encodings.PermutationEncoding {
29  [Item("InversionMoveTabuMaker", "Declares a given inversion move (2-opt) as tabu, by adding its attributes to the tabu list and also store the solution quality or the move quality (whichever is better).")]
30  [StorableClass]
31  public class InversionMoveTabuMaker : TabuMaker, IPermutationInversionMoveQualityOperator {
32    public ILookupParameter<Permutation> PermutationParameter {
33      get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
34    }
35    public ILookupParameter<InversionMove> InversionMoveParameter {
36      get { return (LookupParameter<InversionMove>)Parameters["InversionMove"]; }
37    }
38
39    [StorableConstructor]
40    protected InversionMoveTabuMaker(bool deserializing) : base(deserializing) { }
41    protected InversionMoveTabuMaker(InversionMoveTabuMaker original, Cloner cloner) : base(original, cloner) { }
42    public InversionMoveTabuMaker()
43      : base() {
44      Parameters.Add(new LookupParameter<InversionMove>("InversionMove", "The move that was made."));
45      Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
46    }
47
48    public override IDeepCloneable Clone(Cloner cloner) {
49      return new InversionMoveTabuMaker(this, cloner);
50    }
51
52    protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
53      InversionMove move = InversionMoveParameter.ActualValue;
54      Permutation permutation = PermutationParameter.ActualValue;
55      double baseQuality = moveQuality;
56      if (maximization && quality > moveQuality || !maximization && quality < moveQuality) baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
57      if (permutation.PermutationType == PermutationTypes.Absolute)
58        return new InversionMoveAbsoluteAttribute(move.Index1, permutation[move.Index1], move.Index2, permutation[move.Index2], baseQuality);
59      else
60        return new InversionMoveRelativeAttribute(permutation.GetCircular(move.Index1 - 1),
61          permutation[move.Index1],
62          permutation[move.Index2],
63          permutation.GetCircular(move.Index2 + 1),
64          baseQuality);
65    }
66  }
67}
Note: See TracBrowser for help on using the repository browser.