1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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 HeuristicLab.Problems.BinPacking.Interfaces;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Encodings.PackingEncoding.GroupingVector {
|
---|
31 | [Item("Single grouping tabu maker", "Declares a given single grouping move as tabu, by adding its attributes to the tabu list and also store the solution quality or the move quality (whichever is better).")]
|
---|
32 | [StorableClass]
|
---|
33 | public class SingleGroupingTabuMaker : TabuMaker, IGroupingVectorMoveOperator{
|
---|
34 | public ILookupParameter<IPackingMove> PackingMoveParameter {
|
---|
35 | get { return (ILookupParameter<IPackingMove>)Parameters["PackingMove"]; }
|
---|
36 | }
|
---|
37 | public ILookupParameter<GroupingVectorEncoding> GroupingVectorParameter {
|
---|
38 | get { return (ILookupParameter<GroupingVectorEncoding>)Parameters["GroupingVector"]; }
|
---|
39 | }
|
---|
40 |
|
---|
41 | [StorableConstructor]
|
---|
42 | protected SingleGroupingTabuMaker(bool deserializing) : base(deserializing) { }
|
---|
43 | protected SingleGroupingTabuMaker(SingleGroupingTabuMaker original, Cloner cloner) : base(original, cloner) { }
|
---|
44 | public SingleGroupingTabuMaker()
|
---|
45 | : base() {
|
---|
46 | Parameters.Add(new LookupParameter<IPackingMove>("PackingMove", "The move to evaluate."));
|
---|
47 | Parameters.Add(new LookupParameter<GroupingVectorEncoding>("GroupingVector", "The solution to evaluate."));
|
---|
48 | }
|
---|
49 |
|
---|
50 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
51 | return new SingleGroupingTabuMaker(this, cloner);
|
---|
52 | }
|
---|
53 |
|
---|
54 | protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
|
---|
55 | IPackingMove move = PackingMoveParameter.ActualValue;
|
---|
56 | GroupingVectorEncoding groupingVector = GroupingVectorParameter.ActualValue;
|
---|
57 | double baseQuality = moveQuality;
|
---|
58 | if (maximization && quality > moveQuality || !maximization && quality < moveQuality)
|
---|
59 | baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
|
---|
60 |
|
---|
61 | var sgMove = move as SingleGroupingMove;
|
---|
62 | if (sgMove != null)
|
---|
63 | return new SingleGroupingMoveAttribute(sgMove.Index, sgMove.NewGroup, baseQuality);
|
---|
64 | else
|
---|
65 | return move.GetSolutionAfterMove();
|
---|
66 | }
|
---|
67 | }
|
---|
68 | }
|
---|