source: branches/MemPRAlgorithm/HeuristicLab.Encodings.LinearLinkageEncoding/3.4/Moves/ShiftMove.cs @ 14544

Last change on this file since 14544 was 14544, checked in by abeham, 3 years ago

#2701:

  • LLE: Added equality comparer
  • MemPR:
    • Added GPR to learn about heuristic performance
    • Changed Breeding to do more exhaustive search on crossover
    • Added Delinking separately to Relinking
    • Rewrote d/relinking for LLE
    • Reduce usage of local search
    • Renamed TabuWalk to AdaptiveWalk
    • Rewrote adaptive walk for binary problems
    • Renamed LLE namespace to Grouping to avoid namespace clashes
File size: 3.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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 System;
23
24namespace HeuristicLab.Encodings.LinearLinkageEncoding {
25  public class ShiftMove : Move {
26    public int PreviousItemOfOldGroup { get; private set; }
27    public int PreviousItemOfNewGroup { get; private set; }
28    public int NextItemOfOldGroup { get; private set; }
29    public int NextItemOfNewGroup { get; private set; }
30
31    private bool IsFirst { get { return PreviousItemOfOldGroup == Item; } }
32    private bool IsLast { get { return NextItemOfOldGroup == Item; } }
33    private bool NewGroupClosed { get { return PreviousItemOfNewGroup == NextItemOfNewGroup; } }
34
35    public ShiftMove(int item, int prevOld, int prevNew, int nextOld, int nextNew) {
36      Item = item;
37      PreviousItemOfOldGroup = prevOld;
38      PreviousItemOfNewGroup = prevNew;
39      NextItemOfOldGroup = nextOld;
40      NextItemOfNewGroup = nextNew;
41    }
42
43    public override void Apply(LinearLinkage lle) {
44      if ((!IsFirst && lle[PreviousItemOfOldGroup] != Item)
45        || lle[Item] != NextItemOfOldGroup
46        || lle[PreviousItemOfNewGroup] != NextItemOfNewGroup)
47        throw new ArgumentException("Move conditions have changed!");
48      if (!IsFirst)
49        lle[PreviousItemOfOldGroup] = IsLast ? PreviousItemOfOldGroup : NextItemOfOldGroup;
50      lle[PreviousItemOfNewGroup] = Item;
51      lle[Item] = NewGroupClosed ? Item : NextItemOfNewGroup;
52    }
53
54    public override void Undo(LinearLinkage lle) {
55      if (!IsFirst && lle[PreviousItemOfOldGroup] != (IsLast ? PreviousItemOfOldGroup : NextItemOfOldGroup)
56        || lle[PreviousItemOfNewGroup] != Item
57        || lle[Item] != (NewGroupClosed ? Item : NextItemOfNewGroup))
58        throw new ArgumentException("Move conditions have changed, cannot undo move.");
59
60      if (!IsFirst)
61        lle[PreviousItemOfOldGroup] = Item;
62      lle[PreviousItemOfNewGroup] = NextItemOfNewGroup;
63      lle[Item] = NextItemOfOldGroup;
64    }
65
66    public override void ApplyToLLEb(int[] lleb) {
67      if (!IsLast)
68        lleb[NextItemOfOldGroup] = IsFirst ? NextItemOfOldGroup : PreviousItemOfOldGroup;
69      lleb[Item] = PreviousItemOfNewGroup;
70      if (!NewGroupClosed)
71        lleb[NextItemOfNewGroup] = Item;
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.