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