Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Zhu/Crossovers/ZhuPermutationCrossover.cs

Last change on this file was 17181, checked in by swagner, 5 years ago

#2875: Merged r17180 from trunk to stable

File size: 3.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 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.Encodings.PermutationEncoding;
25using HeuristicLab.Parameters;
26using HEAL.Attic;
27
28namespace HeuristicLab.Problems.VehicleRouting.Encodings.Zhu {
29  [Item("ZhuPermutationCrossover", "An operator which crosses two VRP representations using a standard permutation operator. 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  [StorableType("1D216531-C9D8-4A12-BCFD-7E97161EC383")]
31  public sealed class PrinsPermutationCrossover : ZhuCrossover {
32    public IValueLookupParameter<IPermutationCrossover> InnerCrossoverParameter {
33      get { return (IValueLookupParameter<IPermutationCrossover>)Parameters["InnerCrossover"]; }
34    }
35
36    [StorableConstructor]
37    private PrinsPermutationCrossover(StorableConstructorFlag _) : base(_) { }
38
39    public PrinsPermutationCrossover()
40      : base() {
41      Parameters.Add(new ValueLookupParameter<IPermutationCrossover>("InnerCrossover", "The permutation crossover.", new PartiallyMatchedCrossover()));
42    }
43
44    public override IDeepCloneable Clone(Cloner cloner) {
45      return new PrinsPermutationCrossover(this, cloner);
46    }
47
48    private PrinsPermutationCrossover(PrinsPermutationCrossover original, Cloner cloner)
49      : base(original, cloner) {
50    }
51
52    protected override ZhuEncoding Crossover(IRandom random, ZhuEncoding parent1, ZhuEncoding parent2) {
53      //note - the inner crossover is called here and the result is converted to a prins representation
54      //some refactoring should be done here in the future - the crossover operation should be called directly
55      if (parent1.Length != parent2.Length)
56        return parent1.Clone() as ZhuEncoding;
57
58      InnerCrossoverParameter.ActualValue.ParentsParameter.ActualName = ParentsParameter.ActualName;
59      IAtomicOperation op = this.ExecutionContext.CreateOperation(
60        InnerCrossoverParameter.ActualValue, this.ExecutionContext.Scope);
61      op.Operator.Execute((IExecutionContext)op, CancellationToken);
62
63      string childName = InnerCrossoverParameter.ActualValue.ChildParameter.ActualName;
64      if (ExecutionContext.Scope.Variables.ContainsKey(childName)) {
65        Permutation permutation = ExecutionContext.Scope.Variables[childName].Value as Permutation;
66        ExecutionContext.Scope.Variables.Remove(childName);
67
68        return new ZhuEncoding(permutation, ProblemInstance);
69      } else
70        return null;
71    }
72  }
73}
Note: See TracBrowser for help on using the repository browser.