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