[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.Data;
|
---|
| 25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 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.PackingSequence {
|
---|
| 32 | [Item("PackingSequenceCreator", "Creator class used to create PackingSequence solutions for bin packing problems.")]
|
---|
| 33 | [StorableClass]
|
---|
| 34 | public class PackingSequenceRandomCreator : PackingSolutionCreator, IStochasticOperator {
|
---|
| 35 |
|
---|
| 36 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 37 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 38 | }
|
---|
| 39 | public IValueLookupParameter<IntValue> PackingItemsParameter {
|
---|
| 40 | get { return (IValueLookupParameter<IntValue>)Parameters["PackingItems"]; }
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | [StorableConstructor]
|
---|
| 44 | protected PackingSequenceRandomCreator(bool deserializing) : base(deserializing) { }
|
---|
| 45 | protected PackingSequenceRandomCreator(PackingSequenceRandomCreator original, Cloner cloner) : base(original, cloner) {
|
---|
| 46 | }
|
---|
| 47 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 48 | return new PackingSequenceRandomCreator(this, cloner);
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | public PackingSequenceRandomCreator()
|
---|
| 52 | : base() {
|
---|
| 53 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator."));
|
---|
| 54 | Parameters.Add(new ValueLookupParameter<IntValue>("PackingItems", "The number of packing-items handled in this problem instance."));
|
---|
| 55 |
|
---|
| 56 | EncodedSolutionParameter.ActualName = "PackingSequence";
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 |
|
---|
| 60 | public static PackingSequenceEncoding Apply(int items, IRandom random) {
|
---|
| 61 | var solution = new PackingSequenceEncoding();
|
---|
[9563] | 62 | solution.PackingSequence = new Permutation(PermutationTypes.Absolute, items, random);
|
---|
| 63 | return solution;
|
---|
| 64 | }
|
---|
[9348] | 65 |
|
---|
[9563] | 66 | protected override IItem CreateSolution() {
|
---|
[9348] | 67 | return Apply(PackingItemsParameter.ActualValue.Value, RandomParameter.ActualValue);
|
---|
| 68 | }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|