Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/GroupingVector/GroupingVectorRandomCreator.cs @ 9440

Last change on this file since 9440 was 9440, checked in by jhelm, 11 years ago

#1966: Implemented new encoding (MultiComponentVector/MCV); Implemented move-operators for MCV and GV encodings; Implemented new decoding-methods for PS, GV and MCV encodings (ExtremePoint-based packing);

File size: 3.2 KB
Line 
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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.IntegerVectorEncoding;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29using HeuristicLab.Problems.BinPacking.Interfaces;
30
31namespace HeuristicLab.Encodings.PackingEncoding.GroupingVector {
32  [Item("Grouping Vector Creator", "Creator class used to create GroupingVector solutions for bin packing problems.")]
33  [StorableClass]
34  public class GroupingVectorRandomCreator : 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    public IValueLookupParameter<IntValue> LowerBoundParameter {
43      get { return (IValueLookupParameter<IntValue>)Parameters["LowerBound"]; }
44    }
45
46    [StorableConstructor]
47    protected GroupingVectorRandomCreator(bool deserializing) : base(deserializing) { }
48    protected GroupingVectorRandomCreator(GroupingVectorRandomCreator original, Cloner cloner) : base(original, cloner) {
49    }
50    public override IDeepCloneable Clone(Cloner cloner) {
51      return new GroupingVectorRandomCreator(this, cloner);
52    }
53
54    public GroupingVectorRandomCreator()
55      : base() {
56      Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator."));
57      Parameters.Add(new ValueLookupParameter<IntValue>("PackingItems", "The number of packing-items handled in this problem instance."));
58      Parameters.Add(new ValueLookupParameter<IntValue>("LowerBound", "The lower possible number of bins needed to solve this problem (taken from Dell'Amico, Martello and Vigo; 2002)"));
59
60      EncodedSolutionParameter.ActualName = "GroupingVector";
61    }
62
63
64    public static GroupingVectorEncoding Apply(int items, int lowerBound, IRandom random) {
65      var solution = new GroupingVectorEncoding();
66      solution.GroupingVector = new IntegerVector(items, random, 0, lowerBound + 1);
67      return solution;
68    }
69
70    protected override IPackingSolutionEncoding CreateSolution() {
71      return Apply(PackingItemsParameter.ActualValue.Value, LowerBoundParameter.ActualValue.Value, RandomParameter.ActualValue);
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.