source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/Swap2/Swap2Move.cs @ 14128

Last change on this file since 14128 was 14128, checked in by gkronber, 5 years ago

#1966: refactoring of bin packing implementation

File size: 3.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Joseph Helm and 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
23using System;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Encodings.PermutationEncoding;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Problems.BinPacking;
29
30
31namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
32  [Item("Swap2 Move", "A move on a Sequence vector that is specified by two group-assignment-indexes.")]
33  [StorableClass]
34  public class Swap2Move : SequenceMove, IPackingMove<Permutation> {
35    [Storable]
36    public int Index1 { get; protected set; }
37    [Storable]
38    public int Index2 { get; protected set; }
39
40    [StorableConstructor]
41    protected Swap2Move(bool deserializing) : base(deserializing) { }
42    protected Swap2Move(Swap2Move original, Cloner cloner)
43      : base(original, cloner) {
44      this.Index1 = original.Index1;
45      this.Index2 = original.Index2;
46    }
47    public Swap2Move(int index1, int index2, Permutation packingSequence)
48      : base(packingSequence) {
49      Index1 = index1;
50      Index2 = index2;
51    }
52
53    public override IDeepCloneable Clone(Cloner cloner) {
54      return new Swap2Move(this, cloner);
55    }
56
57    public override Permutation GetSolutionAfterMove() {
58      Permutation newSolution = (Permutation)PackingSequence.Clone(new Cloner());
59      newSolution[Index1] = PackingSequence[Index2];
60      newSolution[Index2] = PackingSequence[Index1];
61      return newSolution;
62    }
63
64    public override Type GetMoveAttributeType() {
65      return typeof(Swap2MoveAttribute);
66    }
67
68    public override SequenceMoveAttribute GetAttribute(double quality) {
69      return new Swap2MoveAttribute(Index1, Index2, PackingSequence[Index1], PackingSequence[Index2], quality);
70    }
71
72    public override bool BelongsToAttribute(SequenceMoveAttribute attribute, bool hardCriterion) {
73      var attr = attribute as Swap2MoveAttribute;
74      if (attr != null) {
75        if (hardCriterion) {
76          if (Index1 == attr.Index1 || Index2 == attr.Index2)// || PackingSequence.PackingSequence[Index1] == attr.AssignedBin1 || PackingSequence.PackingSequence[Index2] == attr.AssignedBin2)
77            return true;
78        } else
79          if (Index1 == attr.Index1 && Index2 == attr.Index2)// && PackingSequence.PackingSequence[Index1] == attr.AssignedBin1 && PackingSequence.PackingSequence[Index2] == attr.AssignedBin2)
80            return true;
81      }
82      return false;
83    }
84
85    public override string ToString() {
86      return "SGM(i1="+Index1 + ", i2=" + Index2  +")";
87    }
88  }
89}
Note: See TracBrowser for help on using the repository browser.