[13412] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13412] | 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;
|
---|
[12272] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Problems.PTSP {
|
---|
[13412] | 28 | [Item("2.5-Move", "Represents a 2.5-move.")]
|
---|
| 29 | [StorableClass]
|
---|
| 30 | public sealed class TwoPointFiveMove : Item {
|
---|
| 31 | [Storable]
|
---|
[14140] | 32 | public int Index1 { get; private set; }
|
---|
[13412] | 33 | [Storable]
|
---|
[14140] | 34 | public int Index2 { get; private set; }
|
---|
[13412] | 35 | [Storable]
|
---|
[14140] | 36 | public Permutation Permutation { get; private set; }
|
---|
[13412] | 37 | [Storable]
|
---|
[14140] | 38 | public bool IsInvert { get; private set; }
|
---|
[13412] | 39 |
|
---|
[12272] | 40 | [StorableConstructor]
|
---|
[13412] | 41 | public TwoPointFiveMove() : this(-1, -1, null, true) { }
|
---|
| 42 | private TwoPointFiveMove(bool deserializing) : base(deserializing) { }
|
---|
| 43 | private TwoPointFiveMove(TwoPointFiveMove original, Cloner cloner)
|
---|
[12272] | 44 | : base(original, cloner) {
|
---|
| 45 | this.Index1 = original.Index1;
|
---|
| 46 | this.Index2 = original.Index2;
|
---|
| 47 | this.IsInvert = original.IsInvert;
|
---|
[13412] | 48 | this.Permutation = cloner.Clone(original.Permutation);
|
---|
[12272] | 49 | }
|
---|
| 50 | public TwoPointFiveMove(int index1, int index2, Permutation permutation, bool isinvert)
|
---|
| 51 | : base() {
|
---|
| 52 | Index1 = index1;
|
---|
| 53 | Index2 = index2;
|
---|
| 54 | IsInvert = isinvert;
|
---|
| 55 | Permutation = permutation;
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | public TwoPointFiveMove(int index1, int index2, bool isinvert)
|
---|
| 59 | : base() {
|
---|
| 60 | Index1 = index1;
|
---|
| 61 | Index2 = index2;
|
---|
| 62 | IsInvert = isinvert;
|
---|
| 63 | Permutation = null;
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 67 | return new TwoPointFiveMove(this, cloner);
|
---|
| 68 | }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|