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 System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Encodings.IntegerVectorEncoding;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
|
---|
30 | [Item("N-Move", "An N-Move describes the relocation of n equipments to n different locations.")]
|
---|
31 | [StorableClass]
|
---|
32 | public class NMove : Item {
|
---|
33 | [Storable]
|
---|
34 | public Dictionary<int, int> NewAssignments { get; private set; }
|
---|
35 | [Storable]
|
---|
36 | public IntegerVector OriginalVector { get; private set; }
|
---|
37 |
|
---|
38 | public int N { get { return NewAssignments.Count; } }
|
---|
39 |
|
---|
40 | [StorableConstructor]
|
---|
41 | protected NMove(bool deserializing) : base(deserializing) { }
|
---|
42 | protected NMove(NMove original, Cloner cloner)
|
---|
43 | : base(original, cloner) {
|
---|
44 | NewAssignments = new Dictionary<int, int>(original.NewAssignments);
|
---|
45 | if (original.OriginalVector != null)
|
---|
46 | OriginalVector = cloner.Clone(original.OriginalVector);
|
---|
47 | }
|
---|
48 | public NMove() : this(new int[0], new int[0], null) { }
|
---|
49 | public NMove(int[] equipments, int[] locations) : this(equipments, locations, null) { }
|
---|
50 | public NMove(int[] equipments, int[] locations, IntegerVector originalVector)
|
---|
51 | : base() {
|
---|
52 | if (equipments == null) throw new ArgumentNullException("equipments", "NMove: Equipments must not be null.");
|
---|
53 | if (locations == null) throw new ArgumentNullException("locations", "NMove: Locations must not be null.");
|
---|
54 | if (equipments.Length != locations.Length) throw new ArgumentException("NMove: Length of equipments and locations is not identical.");
|
---|
55 | NewAssignments = new Dictionary<int, int>();
|
---|
56 | for (int i = 0; i < equipments.Length; i++)
|
---|
57 | NewAssignments[equipments[i]] = locations[i];
|
---|
58 | OriginalVector = originalVector;
|
---|
59 | }
|
---|
60 |
|
---|
61 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
62 | return new NMove(this, cloner);
|
---|
63 | }
|
---|
64 | }
|
---|
65 | }
|
---|