[6406] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 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.Encodings.IntegerVectorEncoding;
|
---|
[16565] | 25 | using HEAL.Attic;
|
---|
[6406] | 26 |
|
---|
| 27 | namespace HeuristicLab.Encodings.ScheduleEncoding.PriorityRulesVector {
|
---|
| 28 | [Item("PRVDiscreteCrossover", "Represents a crossover operation swapping sequences of the parents to generate offspring.")]
|
---|
[16565] | 29 | [StorableType("79050109-0BDC-4EBE-A290-D32F99BB45D4")]
|
---|
[6406] | 30 | public class PRVDiscreteCrossover : PRVCrossover {
|
---|
[8887] | 31 |
|
---|
[6406] | 32 | [StorableConstructor]
|
---|
[16565] | 33 | protected PRVDiscreteCrossover(StorableConstructorFlag _) : base(_) { }
|
---|
[8887] | 34 | protected PRVDiscreteCrossover(PRVDiscreteCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
| 35 | public PRVDiscreteCrossover() : base() { }
|
---|
| 36 |
|
---|
[6406] | 37 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 38 | return new PRVDiscreteCrossover(this, cloner);
|
---|
| 39 | }
|
---|
| 40 |
|
---|
| 41 | public static PRVEncoding Apply(IRandom random, PRVEncoding parent1, PRVEncoding parent2) {
|
---|
[8025] | 42 | return new PRVEncoding(DiscreteCrossover.Apply(random, new ItemArray<IntegerVector>(new IntegerVector[] { parent1.PriorityRulesVector, parent2.PriorityRulesVector })), parent1.NrOfRules);
|
---|
[6406] | 43 | }
|
---|
[8887] | 44 |
|
---|
[6406] | 45 | public override PRVEncoding Cross(IRandom random, PRVEncoding parent1, PRVEncoding parent2) {
|
---|
[6414] | 46 | return Apply(random, parent1, parent2);
|
---|
[6406] | 47 | }
|
---|
| 48 | }
|
---|
| 49 | }
|
---|