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.Core;
|
---|
23 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
24 | using HeuristicLab.Parameters;
|
---|
25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Common;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Zhu {
|
---|
30 | [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.")]
|
---|
31 | [StorableClass]
|
---|
32 | public sealed class PrinsPermutationCrossover : ZhuCrossover {
|
---|
33 | public IValueLookupParameter<IPermutationCrossover> InnerCrossoverParameter {
|
---|
34 | get { return (IValueLookupParameter<IPermutationCrossover>)Parameters["InnerCrossover"]; }
|
---|
35 | }
|
---|
36 |
|
---|
37 | [StorableConstructor]
|
---|
38 | private PrinsPermutationCrossover(bool deserializing) : base(deserializing) { }
|
---|
39 |
|
---|
40 | public PrinsPermutationCrossover()
|
---|
41 | : base() {
|
---|
42 | Parameters.Add(new ValueLookupParameter<IPermutationCrossover>("InnerCrossover", "The permutation crossover.", new PartiallyMatchedCrossover()));
|
---|
43 | }
|
---|
44 |
|
---|
45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
46 | return new PrinsPermutationCrossover(this, cloner);
|
---|
47 | }
|
---|
48 |
|
---|
49 | private PrinsPermutationCrossover(PrinsPermutationCrossover original, Cloner cloner)
|
---|
50 | : base(original, cloner) {
|
---|
51 | }
|
---|
52 |
|
---|
53 | protected override ZhuEncoding Crossover(IRandom random, ZhuEncoding parent1, ZhuEncoding parent2) {
|
---|
54 | //note - the inner crossover is called here and the result is converted to a prins representation
|
---|
55 | //some refactoring should be done here in the future - the crossover operation should be called directly
|
---|
56 |
|
---|
57 | InnerCrossoverParameter.ActualValue.ParentsParameter.ActualName = ParentsParameter.ActualName;
|
---|
58 | IAtomicOperation op = this.ExecutionContext.CreateOperation(
|
---|
59 | InnerCrossoverParameter.ActualValue, this.ExecutionContext.Scope);
|
---|
60 | op.Operator.Execute((IExecutionContext)op, CancellationToken);
|
---|
61 |
|
---|
62 | string childName = InnerCrossoverParameter.ActualValue.ChildParameter.ActualName;
|
---|
63 | if (ExecutionContext.Scope.Variables.ContainsKey(childName)) {
|
---|
64 | Permutation permutation = ExecutionContext.Scope.Variables[childName].Value as Permutation;
|
---|
65 | ExecutionContext.Scope.Variables.Remove(childName);
|
---|
66 |
|
---|
67 | return new ZhuEncoding(permutation, ProblemInstance);
|
---|
68 | } else
|
---|
69 | return null;
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|