Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.Knapsack/3.3/Knapsack.cs @ 3110

Last change on this file since 3110 was 3110, checked in by svonolfe, 14 years ago

Further implemented review comments (#917)

File size: 11.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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 System;
23using System.Collections.Generic;
24using System.Drawing;
25using System.Linq;
26using HeuristicLab.Common;
27using HeuristicLab.Core;
28using HeuristicLab.Data;
29using HeuristicLab.Encodings.BinaryVectorEncoding;
30using HeuristicLab.Optimization;
31using HeuristicLab.Parameters;
32using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
33using HeuristicLab.PluginInfrastructure;
34
35namespace HeuristicLab.Problems.Knapsack {
36  [Item("Knapsack", "Represents a Knapsack Problem.")]
37  [Creatable("Problems")]
38  [StorableClass]
39  public sealed class Knapsack : ParameterizedNamedItem, ISingleObjectiveProblem {
40    public override Image ItemImage {
41      get { return HeuristicLab.Common.Resources.VS2008ImageLibrary.Type; }
42    }
43
44    #region Parameter Properties
45    public ValueParameter<BoolValue> MaximizationParameter {
46      get { return (ValueParameter<BoolValue>)Parameters["Maximization"]; }
47    }
48    IParameter ISingleObjectiveProblem.MaximizationParameter {
49      get { return MaximizationParameter; }
50    }
51    public ValueParameter<IntValue> KnapsackCapacityParameter {
52      get { return (ValueParameter<IntValue>)Parameters["KnapsackCapacity"]; }
53    }
54    public ValueParameter<IntArray> WeightsParameter {
55      get { return (ValueParameter<IntArray>)Parameters["Weights"]; }
56    }
57    public ValueParameter<IntArray> ValuesParameter {
58      get { return (ValueParameter<IntArray>)Parameters["Values"]; }
59    }
60    public ValueParameter<DoubleValue> PenaltyParameter {
61      get { return (ValueParameter<DoubleValue>)Parameters["Penalty"]; }
62    }
63    public ValueParameter<IBinaryVectorCreator> SolutionCreatorParameter {
64      get { return (ValueParameter<IBinaryVectorCreator>)Parameters["SolutionCreator"]; }
65    }
66    IParameter IProblem.SolutionCreatorParameter {
67      get { return SolutionCreatorParameter; }
68    }
69    public ValueParameter<IKnapsackEvaluator> EvaluatorParameter {
70      get { return (ValueParameter<IKnapsackEvaluator>)Parameters["Evaluator"]; }
71    }
72    IParameter IProblem.EvaluatorParameter {
73      get { return EvaluatorParameter; }
74    }
75    IParameter IProblem.VisualizerParameter {
76      get { throw new NotImplementedException(); }
77    }
78    public OptionalValueParameter<DoubleValue> BestKnownQualityParameter {
79      get { return (OptionalValueParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
80    }
81    IParameter ISingleObjectiveProblem.BestKnownQualityParameter {
82      get { return BestKnownQualityParameter; }
83    }
84    #endregion
85
86    #region Properties
87    public IntValue KnapsackCapacity {
88      get { return KnapsackCapacityParameter.Value; }
89      set { KnapsackCapacityParameter.Value = value; }
90    }
91    public IntArray Weights {
92      get { return WeightsParameter.Value; }
93      set { WeightsParameter.Value = value; }
94    }
95    public IntArray Values {
96      get { return ValuesParameter.Value; }
97      set { ValuesParameter.Value = value; }
98    }
99    public DoubleValue Penalty {
100      get { return PenaltyParameter.Value; }
101      set { PenaltyParameter.Value = value; }
102    }
103    public IBinaryVectorCreator SolutionCreator {
104      get { return SolutionCreatorParameter.Value; }
105      set { SolutionCreatorParameter.Value = value; }
106    }
107    ISolutionCreator IProblem.SolutionCreator {
108      get { return SolutionCreatorParameter.Value; }
109    }
110    public IKnapsackEvaluator Evaluator {
111      get { return EvaluatorParameter.Value; }
112      set { EvaluatorParameter.Value = value; }
113    }
114    ISingleObjectiveEvaluator ISingleObjectiveProblem.Evaluator {
115      get { return EvaluatorParameter.Value; }
116    }
117    IEvaluator IProblem.Evaluator {
118      get { return EvaluatorParameter.Value; }
119    }
120    ISolutionsVisualizer IProblem.Visualizer {
121      get { throw new NotImplementedException(); }
122    }
123    public DoubleValue BestKnownQuality {
124      get { return BestKnownQualityParameter.Value; }
125      set { BestKnownQualityParameter.Value = value; }
126    }
127    private List<IBinaryVectorOperator> operators;
128    public IEnumerable<IOperator> Operators {
129      get { return operators.Cast<IOperator>(); }
130    }
131    #endregion
132
133    public Knapsack()
134      : base() {
135      RandomBinaryVectorCreator creator = new RandomBinaryVectorCreator();
136      KnapsackEvaluator evaluator = new KnapsackEvaluator();
137
138      Parameters.Add(new ValueParameter<BoolValue>("Maximization", "Set to true as the Knapsack Problem is a maximization problem.", new BoolValue(true)));
139      Parameters.Add(new ValueParameter<IntValue>("KnapsackCapacity", "Capacity of the Knapsack.", new IntValue(0)));
140      Parameters.Add(new ValueParameter<IntArray>("Weights", "The weights of the items.", new IntArray(5)));
141      Parameters.Add(new ValueParameter<IntArray>("Values", "The values of the items.", new IntArray(5)));
142      Parameters.Add(new ValueParameter<DoubleValue>("Penalty", "The penalty value for each unit of overweight.", new DoubleValue(1)));
143      Parameters.Add(new ValueParameter<IBinaryVectorCreator>("SolutionCreator", "The operator which should be used to create new Knapsack solutions.", creator));
144      Parameters.Add(new ValueParameter<IKnapsackEvaluator>("Evaluator", "The operator which should be used to evaluate Knapsack solutions.", evaluator));
145      Parameters.Add(new OptionalValueParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this Knapsack instance."));
146
147      creator.BinaryVectorParameter.ActualName = "KnapsackSolution";
148      evaluator.QualityParameter.ActualName = "NumberOfOnes";
149      ParameterizeSolutionCreator();
150      ParameterizeEvaluator();
151
152      Initialize();
153    }
154
155    [StorableConstructor]
156    private Knapsack(bool deserializing) : base() { }
157
158    public override IDeepCloneable Clone(Cloner cloner) {
159      Knapsack clone = (Knapsack)base.Clone(cloner);
160      clone.Initialize();
161      return clone;
162    }
163
164    #region Events
165    public event EventHandler SolutionCreatorChanged;
166    private void OnSolutionCreatorChanged() {
167      if (SolutionCreatorChanged != null)
168        SolutionCreatorChanged(this, EventArgs.Empty);
169    }
170    public event EventHandler EvaluatorChanged;
171    private void OnEvaluatorChanged() {
172      if (EvaluatorChanged != null)
173        EvaluatorChanged(this, EventArgs.Empty);
174    }
175    public event EventHandler VisualizerChanged;
176    private void OnVisualizerChanged() {
177      if (VisualizerChanged != null)
178        VisualizerChanged(this, EventArgs.Empty);
179    }
180
181    public event EventHandler OperatorsChanged;
182    private void OnOperatorsChanged() {
183      if (OperatorsChanged != null)
184        OperatorsChanged(this, EventArgs.Empty);
185    }
186
187    private void SolutionCreatorParameter_ValueChanged(object sender, EventArgs e) {
188      SolutionCreator.BinaryVectorParameter.ActualNameChanged += new EventHandler(SolutionCreator_PermutationParameter_ActualNameChanged);
189      ParameterizeSolutionCreator();
190      ParameterizeEvaluator();
191      ParameterizeOperators();
192      OnSolutionCreatorChanged();
193    }
194    private void SolutionCreator_PermutationParameter_ActualNameChanged(object sender, EventArgs e) {
195      ParameterizeEvaluator();
196      ParameterizeOperators();
197    }
198    private void EvaluatorParameter_ValueChanged(object sender, EventArgs e) {
199      ParameterizeEvaluator();
200      OnEvaluatorChanged();
201    }
202    void KnapsackCapacityParameter_ValueChanged(object sender, EventArgs e) {
203      ParameterizeEvaluator();
204    }
205    void WeightsParameter_ValueChanged(object sender, EventArgs e) {
206      ParameterizeEvaluator();
207      ParameterizeSolutionCreator();
208    }
209    void ValuesParameter_ValueChanged(object sender, EventArgs e) {
210      ParameterizeEvaluator();
211      ParameterizeSolutionCreator();
212    }
213    void PenaltyParameter_ValueChanged(object sender, EventArgs e) {
214      ParameterizeEvaluator();
215    }
216    #endregion
217
218    #region Helpers
219    [StorableHook(HookType.AfterDeserialization)]
220    private void Initialize() {
221      InitializeOperators();
222      SolutionCreatorParameter.ValueChanged += new EventHandler(SolutionCreatorParameter_ValueChanged);
223      SolutionCreator.BinaryVectorParameter.ActualNameChanged += new EventHandler(SolutionCreator_PermutationParameter_ActualNameChanged);
224      EvaluatorParameter.ValueChanged += new EventHandler(EvaluatorParameter_ValueChanged);
225      KnapsackCapacityParameter.ValueChanged += new EventHandler(KnapsackCapacityParameter_ValueChanged);
226      WeightsParameter.ValueChanged += new EventHandler(WeightsParameter_ValueChanged);
227      ValuesParameter.ValueChanged += new EventHandler(ValuesParameter_ValueChanged);
228      PenaltyParameter.ValueChanged += new EventHandler(PenaltyParameter_ValueChanged);
229    }
230    private void ParameterizeSolutionCreator() {
231      if(SolutionCreator.LengthParameter.Value == null ||
232        SolutionCreator.LengthParameter.Value.Value != WeightsParameter.Value.Length)
233        SolutionCreator.LengthParameter.Value = new IntValue(WeightsParameter.Value.Length);
234    }
235    private void ParameterizeEvaluator() {
236      if (Evaluator is KnapsackEvaluator) {
237        KnapsackEvaluator knapsackEvaluator =
238          (KnapsackEvaluator)Evaluator;
239        knapsackEvaluator.BinaryVectorParameter.ActualName = SolutionCreator.BinaryVectorParameter.ActualName;
240        knapsackEvaluator.KnapsackCapacityParameter.ActualName = KnapsackCapacityParameter.Name;
241        knapsackEvaluator.WeightsParameter.ActualName = WeightsParameter.Name;
242        knapsackEvaluator.ValuesParameter.ActualName = ValuesParameter.Name;
243        knapsackEvaluator.PenaltyParameter.ActualName = PenaltyParameter.Name;
244      }
245    }
246    private void InitializeOperators() {
247      operators = new List<IBinaryVectorOperator>();
248      if (ApplicationManager.Manager != null) {
249        operators.AddRange(ApplicationManager.Manager.GetInstances<IBinaryVectorOperator>());
250        ParameterizeOperators();
251      }
252    }
253    private void ParameterizeOperators() {
254      foreach (IBinaryVectorCrossover op in Operators.OfType<IBinaryVectorCrossover>()) {
255        op.ParentsParameter.ActualName = SolutionCreator.BinaryVectorParameter.ActualName;
256        op.ChildParameter.ActualName = SolutionCreator.BinaryVectorParameter.ActualName;
257      }
258      foreach (IBinaryVectorManipulator op in Operators.OfType<IBinaryVectorManipulator>()) {
259        op.BinaryVectorParameter.ActualName = SolutionCreator.BinaryVectorParameter.ActualName;
260      }
261    }
262    #endregion
263  }
264}
Note: See TracBrowser for help on using the repository browser.