Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.BinPacking/old files/GroupingVector/GroupingVectorRandomCreator.cs @ 16046

Last change on this file since 16046 was 13032, checked in by gkronber, 9 years ago

#1966:

  • removed unused using
  • added/updated license headers
File size: 3.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Joseph Helm and 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;
29
30namespace HeuristicLab.Encodings.PackingEncoding.GroupingVector {
31  [Item("Grouping Vector Creator", "Creator class used to create GroupingVector solutions for bin packing problems.")]
32  [StorableClass]
33  public class GroupingVectorRandomCreator : PackingSolutionCreator, IStochasticOperator {
34
35    public ILookupParameter<IRandom> RandomParameter {
36      get { return (LookupParameter<IRandom>)Parameters["Random"]; }
37    }
38    public IValueLookupParameter<IntValue> PackingItemsParameter {
39      get { return (IValueLookupParameter<IntValue>)Parameters["PackingItems"]; }
40    }
41    public IValueLookupParameter<IntValue> LowerBoundParameter {
42      get { return (IValueLookupParameter<IntValue>)Parameters["LowerBound"]; }
43    }
44
45    [StorableConstructor]
46    protected GroupingVectorRandomCreator(bool deserializing) : base(deserializing) { }
47    protected GroupingVectorRandomCreator(GroupingVectorRandomCreator original, Cloner cloner) : base(original, cloner) {
48    }
49    public override IDeepCloneable Clone(Cloner cloner) {
50      return new GroupingVectorRandomCreator(this, cloner);
51    }
52
53    public GroupingVectorRandomCreator()
54      : base() {
55      Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator."));
56      Parameters.Add(new ValueLookupParameter<IntValue>("PackingItems", "The number of packing-items handled in this problem instance."));
57      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)"));
58
59      EncodedSolutionParameter.ActualName = "GroupingVector";
60    }
61
62
63    public static GroupingVectorEncoding Apply(int items, int lowerBound, IRandom random) {
64      var solution = new GroupingVectorEncoding();
65      solution.GroupingVector = new IntegerVector(items, random, 0, lowerBound + 1);
66      return solution;
67    }
68
69    protected override IItem CreateSolution() {
70      return Apply(PackingItemsParameter.ActualValue.Value, LowerBoundParameter.ActualValue.Value, RandomParameter.ActualValue);
71    }
72  }
73}
Note: See TracBrowser for help on using the repository browser.