[6406] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[6406] | 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.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 25 |
|
---|
| 26 | namespace HeuristicLab.Encodings.ScheduleEncoding.JobSequenceMatrix {
|
---|
| 27 | [Item("JSMOrderCrossover", "Represents a crossover operation swapping sequences of the parents to generate offspring.")]
|
---|
| 28 | [StorableClass]
|
---|
| 29 | public class JSMOXCrossover : JSMCrossover {
|
---|
[8887] | 30 |
|
---|
[6406] | 31 | [StorableConstructor]
|
---|
| 32 | protected JSMOXCrossover(bool deserializing) : base(deserializing) { }
|
---|
[8887] | 33 | protected JSMOXCrossover(JSMOXCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
| 34 | public JSMOXCrossover() : base() { }
|
---|
| 35 |
|
---|
[6406] | 36 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 37 | return new JSMOXCrossover(this, cloner);
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public static JSMEncoding Apply(IRandom random, JSMEncoding parent1, JSMEncoding parent2) {
|
---|
[8887] | 41 | var result = new JSMEncoding();
|
---|
[6406] | 42 |
|
---|
| 43 | for (int i = 0; i < parent1.JobSequenceMatrix.Count; i++) {
|
---|
| 44 | result.JobSequenceMatrix.Add(
|
---|
| 45 | HeuristicLab.Encodings.PermutationEncoding.OrderCrossover.Apply(random,
|
---|
| 46 | parent1.JobSequenceMatrix[i], parent2.JobSequenceMatrix[i]));
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | return result;
|
---|
| 50 | }
|
---|
| 51 |
|
---|
| 52 | public override JSMEncoding Cross(IRandom random, JSMEncoding parent1, JSMEncoding parent2) {
|
---|
| 53 | return Apply(random, parent1, parent2);
|
---|
| 54 | }
|
---|
| 55 | }
|
---|
| 56 | }
|
---|