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 System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using System.Text;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Parameters;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
31 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
32 | using HeuristicLab.Common;
|
---|
33 |
|
---|
34 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.General.Crossovers {
|
---|
35 | [Item("RandomParentCloneCrossover", "An operator which randomly chooses one parent and returns a clone.")]
|
---|
36 | [StorableClass]
|
---|
37 | public sealed class RandomParentCloneCrossover : VRPOperator, IStochasticOperator, IGeneralVRPOperator, IVRPCrossover {
|
---|
38 | public ILookupParameter<IRandom> RandomParameter {
|
---|
39 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
40 | }
|
---|
41 |
|
---|
42 | public ILookupParameter<ItemArray<IVRPEncoding>> ParentsParameter {
|
---|
43 | get { return (ScopeTreeLookupParameter<IVRPEncoding>)Parameters["Parents"]; }
|
---|
44 | }
|
---|
45 |
|
---|
46 | public ILookupParameter<IVRPEncoding> ChildParameter {
|
---|
47 | get { return (ILookupParameter<IVRPEncoding>)Parameters["Child"]; }
|
---|
48 | }
|
---|
49 |
|
---|
50 | [StorableConstructor]
|
---|
51 | private RandomParentCloneCrossover(bool deserializing) : base(deserializing) { }
|
---|
52 |
|
---|
53 | public RandomParentCloneCrossover()
|
---|
54 | : base() {
|
---|
55 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic manipulation operators."));
|
---|
56 |
|
---|
57 | Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("Parents", "The parent permutations which should be crossed."));
|
---|
58 | ParentsParameter.ActualName = "VRPTours";
|
---|
59 | Parameters.Add(new LookupParameter<IVRPEncoding>("Child", "The child permutation resulting from the crossover."));
|
---|
60 | ChildParameter.ActualName = "VRPTours";
|
---|
61 | }
|
---|
62 |
|
---|
63 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
64 | return new RandomParentCloneCrossover(this, cloner);
|
---|
65 | }
|
---|
66 |
|
---|
67 | private RandomParentCloneCrossover(RandomParentCloneCrossover original, Cloner cloner)
|
---|
68 | : base(original, cloner) {
|
---|
69 | }
|
---|
70 |
|
---|
71 | public override IOperation Apply() {
|
---|
72 | if (RandomParameter.ActualValue.Next() < 0.5)
|
---|
73 | ChildParameter.ActualValue = ParentsParameter.ActualValue[0].Clone() as IVRPEncoding;
|
---|
74 | else
|
---|
75 | ChildParameter.ActualValue = ParentsParameter.ActualValue[1].Clone() as IVRPEncoding;
|
---|
76 |
|
---|
77 | return base.Apply();
|
---|
78 | }
|
---|
79 | }
|
---|
80 | }
|
---|