[4379] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14186] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4379] | 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 |
|
---|
[8053] | 22 | using HeuristicLab.Common;
|
---|
[4379] | 23 | using HeuristicLab.Core;
|
---|
[8053] | 24 | using HeuristicLab.Data;
|
---|
[4379] | 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Zhu {
|
---|
| 29 | [Item("ZhuMergeCrossover1", "The Zhu Merge Crossover (Version 1). It is implemented as described in Zhu, K.Q. (2000). A New Genetic Algorithm For VRPTW. Proceedings of the International Conference on Artificial Intelligence.")]
|
---|
| 30 | [StorableClass]
|
---|
[8053] | 31 | public sealed class ZhuMergeCrossover1 : ZhuCrossover {
|
---|
[4379] | 32 | [StorableConstructor]
|
---|
| 33 | private ZhuMergeCrossover1(bool deserializing) : base(deserializing) { }
|
---|
| 34 |
|
---|
| 35 | public ZhuMergeCrossover1()
|
---|
| 36 | : base() {
|
---|
| 37 | }
|
---|
| 38 |
|
---|
[4752] | 39 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 40 | return new ZhuMergeCrossover1(this, cloner);
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | private ZhuMergeCrossover1(ZhuMergeCrossover1 original, Cloner cloner)
|
---|
| 44 | : base(original, cloner) {
|
---|
| 45 | }
|
---|
| 46 |
|
---|
[4379] | 47 | private void Swap(ZhuEncoding individual, int city1, int city2) {
|
---|
| 48 | int index1 = individual.IndexOf(city1);
|
---|
| 49 | int index2 = individual.IndexOf(city2);
|
---|
| 50 |
|
---|
| 51 | int temp = individual[index1];
|
---|
| 52 | individual[index1] = individual[index2];
|
---|
| 53 | individual[index2] = temp;
|
---|
| 54 | }
|
---|
| 55 |
|
---|
| 56 | protected override ZhuEncoding Crossover(IRandom random, ZhuEncoding parent1, ZhuEncoding parent2) {
|
---|
| 57 | parent1 = parent1.Clone() as ZhuEncoding;
|
---|
| 58 | parent2 = parent2.Clone() as ZhuEncoding;
|
---|
| 59 |
|
---|
| 60 | ZhuEncoding child = parent2.Clone() as ZhuEncoding;
|
---|
| 61 |
|
---|
[6771] | 62 | if (parent1.Length != parent2.Length)
|
---|
| 63 | return child;
|
---|
| 64 |
|
---|
[4379] | 65 | int breakPoint = random.Next(child.Length);
|
---|
| 66 | int i = breakPoint;
|
---|
| 67 |
|
---|
| 68 | DoubleArray dueTime = null;
|
---|
| 69 | if (ProblemInstance is ITimeWindowedProblemInstance) {
|
---|
| 70 | dueTime = (ProblemInstance as ITimeWindowedProblemInstance).DueTime;
|
---|
[8053] | 71 | }
|
---|
[4379] | 72 |
|
---|
| 73 | do {
|
---|
| 74 | if (i == breakPoint) {
|
---|
| 75 | child[i] = parent1[i];
|
---|
| 76 | Swap(parent2, parent2[i], parent1[i]);
|
---|
| 77 | } else {
|
---|
| 78 | if (
|
---|
| 79 | (dueTime != null) &&
|
---|
| 80 | (dueTime[parent1[i] + 1] <
|
---|
| 81 | dueTime[parent2[i] + 1])) {
|
---|
| 82 | child[i] = parent1[i];
|
---|
| 83 | Swap(parent2, parent2[i], parent1[i]);
|
---|
| 84 | } else {
|
---|
| 85 | child[i] = parent2[i];
|
---|
| 86 | Swap(parent1, parent1[i], parent2[i]);
|
---|
| 87 | }
|
---|
| 88 | }
|
---|
| 89 |
|
---|
| 90 | i = (i + 1) % child.Length;
|
---|
| 91 | } while (i != breakPoint);
|
---|
| 92 |
|
---|
| 93 | return child;
|
---|
| 94 | }
|
---|
| 95 | }
|
---|
| 96 | }
|
---|