Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Zhu/Crossovers/ZhuMergeCrossover2.cs @ 5991

Last change on this file since 5991 was 4752, checked in by svonolfe, 14 years ago

Merged relevant changes from the trunk into the branch (cloning,...) (#1177)

File size: 3.1 KB
Line 
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
22using HeuristicLab.Core;
23using HeuristicLab.Encodings.PermutationEncoding;
24using HeuristicLab.Parameters;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26using HeuristicLab.Data;
27using System.Collections.Generic;
28using HeuristicLab.Problems.VehicleRouting.Variants;
29using HeuristicLab.Common;
30
31namespace HeuristicLab.Problems.VehicleRouting.Encodings.Zhu {
32  [Item("ZhuMergeCrossover2", "The Zhu Merge 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.")]
33  [StorableClass]
34  public sealed class ZhuMergeCrossover2 : ZhuCrossover {   
35    [StorableConstructor]
36    private ZhuMergeCrossover2(bool deserializing) : base(deserializing) { }
37
38    public ZhuMergeCrossover2()
39      : base() {
40    }
41
42    public override IDeepCloneable Clone(Cloner cloner) {
43      return new ZhuMergeCrossover2(this, cloner);
44    }
45
46    private ZhuMergeCrossover2(ZhuMergeCrossover2 original, Cloner cloner)
47      : base(original, cloner) {
48    }
49
50    protected override ZhuEncoding Crossover(IRandom random, ZhuEncoding parent1, ZhuEncoding parent2) {
51      List<int> p1 = new List<int>(parent1);
52      List<int> p2 = new List<int>(parent2);
53
54      ZhuEncoding child = parent2.Clone() as ZhuEncoding;
55
56      int breakPoint = random.Next(child.Length);
57      int i = breakPoint;
58
59      int parent1Index = i;
60      int parent2Index = i;
61
62      DoubleArray dueTime = null;
63      if (ProblemInstance is ITimeWindowedProblemInstance) {
64        dueTime = (ProblemInstance as ITimeWindowedProblemInstance).DueTime;
65      }
66
67      do {
68        if (i == breakPoint) {
69          child[i] = p1[parent1Index];
70        } else {
71          if (dueTime != null &&
72            (dueTime[p1[parent1Index] + 1] <
73            dueTime[p2[parent2Index] + 1])) {
74            child[i] = p1[parent1Index];
75          } else {
76            child[i] = p2[parent2Index];
77          }
78        }
79
80        p1.Remove(child[i]);
81        if (parent1Index >= p1.Count)
82          parent1Index = 0;
83
84        p2.Remove(child[i]);
85        if (parent2Index >= p2.Count)
86          parent2Index = 0;
87
88        i = (i + 1) % child.Length;
89      } while (i != breakPoint);
90
91      return child;
92    }
93  }
94}
Note: See TracBrowser for help on using the repository browser.