[5200] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5200] | 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 |
|
---|
[8053] | 22 | using HeuristicLab.Common;
|
---|
[5200] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Optimization;
|
---|
| 25 | using HeuristicLab.Parameters;
|
---|
[16565] | 26 | using HEAL.Attic;
|
---|
[5200] | 27 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 28 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.General.Crossovers {
|
---|
| 31 | [Item("RandomParentCloneCrossover", "An operator which randomly chooses one parent and returns a clone.")]
|
---|
[16565] | 32 | [StorableType("418EA2DE-C098-4A88-82B9-CB68732DB2AC")]
|
---|
[5200] | 33 | public sealed class RandomParentCloneCrossover : VRPOperator, IStochasticOperator, IGeneralVRPOperator, IVRPCrossover {
|
---|
| 34 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 35 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | public ILookupParameter<ItemArray<IVRPEncoding>> ParentsParameter {
|
---|
| 39 | get { return (ScopeTreeLookupParameter<IVRPEncoding>)Parameters["Parents"]; }
|
---|
| 40 | }
|
---|
| 41 |
|
---|
| 42 | public ILookupParameter<IVRPEncoding> ChildParameter {
|
---|
| 43 | get { return (ILookupParameter<IVRPEncoding>)Parameters["Child"]; }
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 | [StorableConstructor]
|
---|
[16565] | 47 | private RandomParentCloneCrossover(StorableConstructorFlag _) : base(_) { }
|
---|
[5200] | 48 |
|
---|
| 49 | public RandomParentCloneCrossover()
|
---|
| 50 | : base() {
|
---|
| 51 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic manipulation operators."));
|
---|
| 52 |
|
---|
| 53 | Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("Parents", "The parent permutations which should be crossed."));
|
---|
| 54 | ParentsParameter.ActualName = "VRPTours";
|
---|
| 55 | Parameters.Add(new LookupParameter<IVRPEncoding>("Child", "The child permutation resulting from the crossover."));
|
---|
| 56 | ChildParameter.ActualName = "VRPTours";
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 60 | return new RandomParentCloneCrossover(this, cloner);
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | private RandomParentCloneCrossover(RandomParentCloneCrossover original, Cloner cloner)
|
---|
| 64 | : base(original, cloner) {
|
---|
| 65 | }
|
---|
[8053] | 66 |
|
---|
[10298] | 67 | public override IOperation InstrumentedApply() {
|
---|
[5200] | 68 | if (RandomParameter.ActualValue.Next() < 0.5)
|
---|
| 69 | ChildParameter.ActualValue = ParentsParameter.ActualValue[0].Clone() as IVRPEncoding;
|
---|
| 70 | else
|
---|
| 71 | ChildParameter.ActualValue = ParentsParameter.ActualValue[1].Clone() as IVRPEncoding;
|
---|
| 72 |
|
---|
[10298] | 73 | return base.InstrumentedApply();
|
---|
[5200] | 74 | }
|
---|
| 75 | }
|
---|
| 76 | }
|
---|