1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 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 HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
26 | using HEAL.Attic;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Encodings.ScheduleEncoding.JobSequenceMatrix {
|
---|
29 | [Item("JSMJobbasedOrderCrossover", "Represents a crossover operation swapping subsequences of the parents to generate offspring.")]
|
---|
30 | [StorableType("3D9540B9-6834-4C34-8D5D-001FBF442344")]
|
---|
31 | public class JSMJOXCrossover : JSMCrossover {
|
---|
32 |
|
---|
33 | [StorableConstructor]
|
---|
34 | protected JSMJOXCrossover(StorableConstructorFlag _) : base(_) { }
|
---|
35 | protected JSMJOXCrossover(JSMJOXCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
36 | public JSMJOXCrossover() : base() { }
|
---|
37 |
|
---|
38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
39 | return new JSMJOXCrossover(this, cloner);
|
---|
40 | }
|
---|
41 |
|
---|
42 | public static JSMEncoding Apply(IRandom random, JSMEncoding p1, JSMEncoding p2) {
|
---|
43 | var result = new JSMEncoding();
|
---|
44 |
|
---|
45 | int nrOfResources = p1.JobSequenceMatrix.Count;
|
---|
46 | int nrOfJobs = p1.JobSequenceMatrix[0].Length;
|
---|
47 |
|
---|
48 | //Determine randomly which jobindexes persist
|
---|
49 | var persist = new BoolArray(nrOfJobs);
|
---|
50 | for (int i = 0; i < persist.Length; i++) {
|
---|
51 | persist[i] = random.Next(2) == 1;
|
---|
52 | }
|
---|
53 |
|
---|
54 | bool dominantParent = random.Next(2) == 1;
|
---|
55 | JSMEncoding parent1 = dominantParent ? p1 : p2;
|
---|
56 | JSMEncoding parent2 = dominantParent ? p2 : p1;
|
---|
57 |
|
---|
58 | //Fill childmatrix with values
|
---|
59 | for (int resIndex = 0; resIndex < nrOfResources; resIndex++) {
|
---|
60 | result.JobSequenceMatrix.Add(new Permutation(PermutationTypes.Absolute, nrOfJobs));
|
---|
61 | int parent2index = 0;
|
---|
62 | for (int jobIndex = 0; jobIndex < nrOfJobs; jobIndex++) {
|
---|
63 | if (persist[parent1.JobSequenceMatrix[resIndex][jobIndex]])
|
---|
64 | result.JobSequenceMatrix[resIndex][jobIndex] = parent1.JobSequenceMatrix[resIndex][jobIndex];
|
---|
65 | else {
|
---|
66 | while (persist[parent2.JobSequenceMatrix[resIndex][parent2index]])
|
---|
67 | parent2index++;
|
---|
68 | result.JobSequenceMatrix[resIndex][jobIndex] = parent2.JobSequenceMatrix[resIndex][parent2index];
|
---|
69 | parent2index++;
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|
73 |
|
---|
74 | return result;
|
---|
75 | }
|
---|
76 |
|
---|
77 | public override JSMEncoding Cross(IRandom random, JSMEncoding parent1, JSMEncoding parent2) {
|
---|
78 | return Apply(random, parent1, parent2);
|
---|
79 | }
|
---|
80 | }
|
---|
81 | }
|
---|