Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Zhu/Crossovers/ZhuPermutationCrossover.cs @ 11507

Last change on this file since 11507 was 6771, checked in by svonolfe, 13 years ago

Corrected behavior of various operators when a solution contains more tours than vehicles (#1177)

File size: 3.4 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 HeuristicLab.Common;
28
29namespace 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      if (parent1.Length != parent2.Length)
57        return parent1.Clone() as ZhuEncoding;
58
59      InnerCrossoverParameter.ActualValue.ParentsParameter.ActualName = ParentsParameter.ActualName;
60      IAtomicOperation op = this.ExecutionContext.CreateOperation(
61        InnerCrossoverParameter.ActualValue, this.ExecutionContext.Scope);
62      op.Operator.Execute((IExecutionContext)op, CancellationToken);
63
64      string childName = InnerCrossoverParameter.ActualValue.ChildParameter.ActualName;
65      if (ExecutionContext.Scope.Variables.ContainsKey(childName)) {
66        Permutation permutation = ExecutionContext.Scope.Variables[childName].Value as Permutation;
67        ExecutionContext.Scope.Variables.Remove(childName);
68
69        return new ZhuEncoding(permutation, ProblemInstance);
70      } else
71        return null;
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.