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 |
|
---|
22 | using HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Optimization;
|
---|
25 | using HeuristicLab.Parameters;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
28 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Prins {
|
---|
31 | [Item("PrinsCrossover", "An operator which crosses two VRP representations.")]
|
---|
32 | [StorableClass]
|
---|
33 | public abstract class PrinsCrossover : VRPCrossover, IStochasticOperator, IPrinsOperator {
|
---|
34 |
|
---|
35 | public ILookupParameter<IRandom> RandomParameter {
|
---|
36 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
37 | }
|
---|
38 |
|
---|
39 | [StorableConstructor]
|
---|
40 | protected PrinsCrossover(bool deserializing) : base(deserializing) { }
|
---|
41 |
|
---|
42 | public PrinsCrossover()
|
---|
43 | : base() {
|
---|
44 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic manipulation operators."));
|
---|
45 | }
|
---|
46 |
|
---|
47 | protected PrinsCrossover(PrinsCrossover original, Cloner cloner)
|
---|
48 | : base(original, cloner) {
|
---|
49 | }
|
---|
50 |
|
---|
51 | protected abstract PrinsEncoding Crossover(IRandom random, PrinsEncoding parent1, PrinsEncoding parent2);
|
---|
52 |
|
---|
53 | public override IOperation InstrumentedApply() {
|
---|
54 | ItemArray<IVRPEncoding> parents = new ItemArray<IVRPEncoding>(ParentsParameter.ActualValue.Length);
|
---|
55 | for (int i = 0; i < ParentsParameter.ActualValue.Length; i++) {
|
---|
56 | IVRPEncoding solution = ParentsParameter.ActualValue[i];
|
---|
57 |
|
---|
58 | if (!(solution is PrinsEncoding)) {
|
---|
59 | parents[i] = PrinsEncoding.ConvertFrom(solution, ProblemInstance);
|
---|
60 | } else {
|
---|
61 | parents[i] = solution;
|
---|
62 | }
|
---|
63 | }
|
---|
64 | ParentsParameter.ActualValue = parents;
|
---|
65 |
|
---|
66 | ChildParameter.ActualValue =
|
---|
67 | Crossover(RandomParameter.ActualValue, parents[0] as PrinsEncoding, parents[1] as PrinsEncoding);
|
---|
68 |
|
---|
69 | return base.InstrumentedApply();
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|