1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2015 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.Text;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Encodings.IntegerVectorEncoding;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Encodings.ScheduleEncoding {
|
---|
29 | [Item("PriorityRulesVectorEncoding", "Represents an encoding for a Scheduling Problem.")]
|
---|
30 | [StorableClass]
|
---|
31 | public class PRVEncoding : Item, ISchedule {
|
---|
32 | [Storable]
|
---|
33 | public IntegerVector PriorityRulesVector { get; private set; }
|
---|
34 | [Storable]
|
---|
35 | public int RandomSeed { get; private set; }
|
---|
36 |
|
---|
37 | [StorableConstructor]
|
---|
38 | protected PRVEncoding(bool deserializing) : base(deserializing) { }
|
---|
39 | protected PRVEncoding(PRVEncoding original, Cloner cloner)
|
---|
40 | : base(original, cloner) {
|
---|
41 | this.PriorityRulesVector = cloner.Clone(original.PriorityRulesVector);
|
---|
42 | this.RandomSeed = original.RandomSeed;
|
---|
43 | }
|
---|
44 |
|
---|
45 | public PRVEncoding(IntegerVector iv, int randomSeed)
|
---|
46 | : base() {
|
---|
47 | this.RandomSeed = randomSeed;
|
---|
48 | this.PriorityRulesVector = (IntegerVector)iv.Clone();
|
---|
49 | }
|
---|
50 | public PRVEncoding(int length, IRandom random, int min, int max)
|
---|
51 | : base() {
|
---|
52 | this.RandomSeed = random.Next();
|
---|
53 | this.PriorityRulesVector = new IntegerVector(length, random, min, max);
|
---|
54 | }
|
---|
55 |
|
---|
56 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
57 | return new PRVEncoding(this, cloner);
|
---|
58 | }
|
---|
59 |
|
---|
60 | public override string ToString() {
|
---|
61 | StringBuilder sb = new StringBuilder();
|
---|
62 | sb.Append("[ ");
|
---|
63 |
|
---|
64 | foreach (int i in PriorityRulesVector) {
|
---|
65 | sb.Append(i + " ");
|
---|
66 | }
|
---|
67 |
|
---|
68 | sb.Append("]");
|
---|
69 | return sb.ToString();
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|