[4379] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[11171] | 3 | * Copyright (C) 2002-2014 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 System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
[4379] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Zhu {
|
---|
| 28 | [Item("ZhuHeuristicCrossover2", "The Zhu Heuristic Crossover (Version 2). It is implemented as described in Zhu, K.Q. (2000). A New Genetic Algorithm For VRPTW. Proceedings of the International Conference on Artificial Intelligence.")]
|
---|
| 29 | [StorableClass]
|
---|
[8053] | 30 | public sealed class ZhuHeuristicCrossover2 : ZhuCrossover {
|
---|
[4379] | 31 | [StorableConstructor]
|
---|
| 32 | private ZhuHeuristicCrossover2(bool deserializing) : base(deserializing) { }
|
---|
| 33 |
|
---|
| 34 | public ZhuHeuristicCrossover2()
|
---|
| 35 | : base() {
|
---|
| 36 | }
|
---|
| 37 |
|
---|
[4752] | 38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 39 | return new ZhuHeuristicCrossover2(this, cloner);
|
---|
| 40 | }
|
---|
| 41 |
|
---|
| 42 | private ZhuHeuristicCrossover2(ZhuHeuristicCrossover2 original, Cloner cloner)
|
---|
| 43 | : base(original, cloner) {
|
---|
| 44 | }
|
---|
| 45 |
|
---|
[4379] | 46 | protected override ZhuEncoding Crossover(IRandom random, ZhuEncoding parent1, ZhuEncoding parent2) {
|
---|
| 47 | List<int> p1 = new List<int>(parent1);
|
---|
| 48 | List<int> p2 = new List<int>(parent2);
|
---|
| 49 |
|
---|
| 50 | ZhuEncoding child = parent2.Clone() as ZhuEncoding;
|
---|
| 51 |
|
---|
[6771] | 52 | if (parent1.Length != parent2.Length)
|
---|
| 53 | return child;
|
---|
| 54 |
|
---|
[4379] | 55 | int breakPoint = random.Next(child.Length);
|
---|
| 56 | int i = breakPoint;
|
---|
| 57 | int predecessor = breakPoint - 1;
|
---|
| 58 | if (predecessor < 0)
|
---|
| 59 | predecessor = predecessor + child.Length;
|
---|
[8053] | 60 |
|
---|
[4379] | 61 | int parent1Index = i;
|
---|
| 62 | int parent2Index = i;
|
---|
| 63 |
|
---|
| 64 | while (i != predecessor) {
|
---|
| 65 | if (i == breakPoint) {
|
---|
| 66 | child[i] = p1[parent1Index];
|
---|
[8053] | 67 |
|
---|
[4379] | 68 | p1.Remove(child[i]);
|
---|
| 69 | if (parent1Index >= p1.Count)
|
---|
| 70 | parent1Index = 0;
|
---|
| 71 |
|
---|
| 72 | p2.Remove(child[i]);
|
---|
| 73 | if (parent2Index >= p2.Count)
|
---|
| 74 | parent2Index = 0;
|
---|
| 75 | }
|
---|
| 76 |
|
---|
| 77 | if (ProblemInstance.GetDistance(
|
---|
[6851] | 78 | child[i] + 1, p1[parent1Index] + 1, child)
|
---|
[4379] | 79 | <
|
---|
| 80 | ProblemInstance.GetDistance(
|
---|
[6851] | 81 | child[i] + 1, p2[parent2Index] + 1, child)) {
|
---|
[4379] | 82 | child[(i + 1) % child.Length] = p1[parent1Index];
|
---|
| 83 | } else {
|
---|
| 84 | child[(i + 1) % child.Length] = p2[parent2Index];
|
---|
| 85 | }
|
---|
| 86 |
|
---|
| 87 | p1.Remove(child[(i + 1) % child.Length]);
|
---|
| 88 | if (parent1Index >= p1.Count)
|
---|
| 89 | parent1Index = 0;
|
---|
| 90 |
|
---|
| 91 | p2.Remove(child[(i + 1) % child.Length]);
|
---|
| 92 | if (parent2Index >= p2.Count)
|
---|
| 93 | parent2Index = 0;
|
---|
| 94 |
|
---|
| 95 | i = (i + 1) % child.Length;
|
---|
| 96 | }
|
---|
| 97 |
|
---|
| 98 | return child;
|
---|
| 99 | }
|
---|
| 100 | }
|
---|
| 101 | }
|
---|