Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2522_RefactorPluginInfrastructure/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Prins/Crossovers/PrinsPermutationCrossover.cs @ 15651

Last change on this file since 15651 was 12012, checked in by ascheibe, 10 years ago

#2212 merged r12008, r12009, r12010 back into trunk

File size: 3.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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 HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.VehicleRouting.Encodings.Prins {
29  [Item("PrinsPermutationCrossover", "An operator which crosses two VRP representations using a standard permutation operator.  It is implemented as described in Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 12:1985-2002.")]
30  [StorableClass]
31  public sealed class PrinsPermutationCrossover : PrinsCrossover, IPrinsOperator {
32    public IValueLookupParameter<IPermutationCrossover> InnerCrossoverParameter {
33      get { return (IValueLookupParameter<IPermutationCrossover>)Parameters["InnerCrossover"]; }
34    }
35
36    [StorableConstructor]
37    private PrinsPermutationCrossover(bool deserializing) : base(deserializing) { }
38
39    public PrinsPermutationCrossover()
40      : base() {
41      Parameters.Add(new ValueLookupParameter<IPermutationCrossover>("InnerCrossover", "The permutation crossover.", new OrderCrossover()));
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 PrinsEncoding Crossover(IRandom random, PrinsEncoding parent1, PrinsEncoding parent2) {
53      if (parent1.Length != parent2.Length)
54        return parent1.Clone() as PrinsEncoding;
55
56      //note - the inner crossover is called here and the result is converted to a prins representation
57      //some refactoring should be done here in the future - the crossover operation should be called directly
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 PrinsEncoding(permutation, ProblemInstance);
70      } else
71        return null;
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.