1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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.Persistence.Default.CompositeSerializers.Storable;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Zhu {
|
---|
27 | [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.")]
|
---|
28 | [StorableClass]
|
---|
29 | public sealed class ZhuMergeCrossover1 : ZhuCrossover {
|
---|
30 | [StorableConstructor]
|
---|
31 | private ZhuMergeCrossover1(bool deserializing) : base(deserializing) { }
|
---|
32 | private ZhuMergeCrossover1(ZhuMergeCrossover1 original, Cloner cloner)
|
---|
33 | : base(original, cloner) {
|
---|
34 | }
|
---|
35 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
36 | return new ZhuMergeCrossover1(this, cloner);
|
---|
37 | }
|
---|
38 | public ZhuMergeCrossover1()
|
---|
39 | : base() {
|
---|
40 | }
|
---|
41 |
|
---|
42 | private void Swap(ZhuEncoding individual, int city1, int city2) {
|
---|
43 | int index1 = individual.IndexOf(city1);
|
---|
44 | int index2 = individual.IndexOf(city2);
|
---|
45 |
|
---|
46 | int temp = individual[index1];
|
---|
47 | individual[index1] = individual[index2];
|
---|
48 | individual[index2] = temp;
|
---|
49 | }
|
---|
50 |
|
---|
51 | protected override ZhuEncoding Crossover(IExecutionContext context, IRandom random, ZhuEncoding parent1, ZhuEncoding parent2) {
|
---|
52 | parent1 = parent1.Clone() as ZhuEncoding;
|
---|
53 | parent2 = parent2.Clone() as ZhuEncoding;
|
---|
54 |
|
---|
55 | ZhuEncoding child = parent2.Clone() as ZhuEncoding;
|
---|
56 |
|
---|
57 | int breakPoint = random.Next(child.Length);
|
---|
58 | int i = breakPoint;
|
---|
59 |
|
---|
60 | do {
|
---|
61 | if (i == breakPoint) {
|
---|
62 | child[i] = parent1[i];
|
---|
63 | Swap(parent2, parent2[i], parent1[i]);
|
---|
64 | } else {
|
---|
65 | if (DueTimeParameter.ActualValue[parent1[i] + 1] <
|
---|
66 | DueTimeParameter.ActualValue[parent2[i] + 1]) {
|
---|
67 | child[i] = parent1[i];
|
---|
68 | Swap(parent2, parent2[i], parent1[i]);
|
---|
69 | } else {
|
---|
70 | child[i] = parent2[i];
|
---|
71 | Swap(parent1, parent1[i], parent2[i]);
|
---|
72 | }
|
---|
73 | }
|
---|
74 |
|
---|
75 | i = (i + 1) % child.Length;
|
---|
76 | } while (i != breakPoint);
|
---|
77 |
|
---|
78 | return child;
|
---|
79 | }
|
---|
80 | }
|
---|
81 | }
|
---|