Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.DatasetRefactor/sources/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Zhu/Crossovers/ZhuHeuristicCrossover1.cs @ 11570

Last change on this file since 11570 was 11171, checked in by ascheibe, 10 years ago

#2115 merged r11170 (copyright update) into trunk

File size: 3.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
25
26namespace HeuristicLab.Problems.VehicleRouting.Encodings.Zhu {
27  [Item("ZhuHeuristicCrossover1", "The Zhu Heuristic 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 ZhuHeuristicCrossover1 : ZhuCrossover {
30    [StorableConstructor]
31    private ZhuHeuristicCrossover1(bool deserializing) : base(deserializing) { }
32
33    public ZhuHeuristicCrossover1()
34      : base() {
35    }
36
37    public override IDeepCloneable Clone(Cloner cloner) {
38      return new ZhuHeuristicCrossover1(this, cloner);
39    }
40
41    private ZhuHeuristicCrossover1(ZhuHeuristicCrossover1 original, Cloner cloner)
42      : base(original, cloner) {
43    }
44
45    private void Swap(ZhuEncoding individual, int city1, int city2) {
46      int index1 = individual.IndexOf(city1);
47      int index2 = individual.IndexOf(city2);
48
49      int temp = individual[index1];
50      individual[index1] = individual[index2];
51      individual[index2] = temp;
52    }
53
54    protected override ZhuEncoding Crossover(IRandom random, ZhuEncoding parent1, ZhuEncoding parent2) {
55      parent1 = parent1.Clone() as ZhuEncoding;
56      parent2 = parent2.Clone() as ZhuEncoding;
57
58      ZhuEncoding child = parent2.Clone() as ZhuEncoding;
59
60      if (parent1.Length != parent2.Length)
61        return child;
62
63      int breakPoint = random.Next(child.Length);
64      int i = breakPoint;
65      int predecessor = breakPoint - 1;
66      if (predecessor < 0)
67        predecessor = predecessor + child.Length;
68
69      while (i != predecessor) {
70        if (i == breakPoint) {
71          child[i] = parent1[i];
72          Swap(parent2, parent2[i], parent1[i]);
73        }
74
75        if (ProblemInstance.GetDistance(
76          child[i] + 1, parent1[(i + 1) % child.Length] + 1, child)
77          <
78          ProblemInstance.GetDistance(
79          child[i] + 1, parent2[(i + 1) % child.Length] + 1, child)) {
80          child[(i + 1) % child.Length] = parent1[(i + 1) % child.Length];
81          Swap(parent2, parent2[(i + 1) % child.Length], parent1[(i + 1) % child.Length]);
82        } else {
83          child[(i + 1) % child.Length] = parent2[(i + 1) % child.Length];
84          Swap(parent1, parent1[(i + 1) % child.Length], parent2[(i + 1) % child.Length]);
85        }
86
87        i = (i + 1) % child.Length;
88      }
89
90      return child;
91    }
92  }
93}
Note: See TracBrowser for help on using the repository browser.