[9348] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[13032] | 3 | * Copyright (C) 2002-2015 Joseph Helm and Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[9348] | 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 |
|
---|
[13032] | 22 |
|
---|
[9348] | 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[14046] | 29 | using HeuristicLab.Problems.BinPacking;
|
---|
[9348] | 30 |
|
---|
| 31 | namespace HeuristicLab.Encodings.PackingEncoding {
|
---|
| 32 | [Item("PackingSolutionCrossover", "A bin packing crossover operation.")]
|
---|
| 33 | [StorableClass]
|
---|
[14128] | 34 | public abstract class PackingSolutionCrossover<T> : SingleSuccessorOperator, IPackingSolutionCrossover<T>, IStochasticOperator
|
---|
| 35 | where T : class, IItem {
|
---|
[9348] | 36 |
|
---|
[14128] | 37 | public ILookupParameter<T> ChildParameter {
|
---|
| 38 | get { return (ILookupParameter<T>)Parameters["Child"]; }
|
---|
[9348] | 39 | }
|
---|
[14128] | 40 | public IScopeTreeLookupParameter<T> ParentsParameter {
|
---|
| 41 | get { return (IScopeTreeLookupParameter<T>)Parameters["Parents"]; }
|
---|
[9348] | 42 | }
|
---|
| 43 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 44 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | [StorableConstructor]
|
---|
| 48 | protected PackingSolutionCrossover(bool deserializing) : base(deserializing) { }
|
---|
[14128] | 49 | protected PackingSolutionCrossover(PackingSolutionCrossover<T> original, Cloner cloner) : base(original, cloner) { }
|
---|
[9348] | 50 | public PackingSolutionCrossover()
|
---|
| 51 | : base() {
|
---|
| 52 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic manipulation operators."));
|
---|
[14128] | 53 | Parameters.Add(new LookupParameter<T>("Child", "The child solution resulting from the crossover."));
|
---|
[9348] | 54 | ChildParameter.ActualName = "EncodedSolution";
|
---|
[14128] | 55 | Parameters.Add(new ScopeTreeLookupParameter<T>("Parents", "The parent solution which should be crossed."));
|
---|
[9348] | 56 | ParentsParameter.ActualName = "EncodedSolution";
|
---|
| 57 | }
|
---|
| 58 | }
|
---|
| 59 | }
|
---|