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