source: trunk/sources/HeuristicLab.Encodings.RealVectorEncoding/3.3/RealVector.cs @ 15091

Last change on this file since 15091 was 15091, checked in by abeham, 3 months ago

#2797:

  • Updated PSO to make it more compatible with SPSO 2011
  • Removed truncation of velocity vector and instead rescaled it given the maximum velocity
  • Added non-zero initial velocity according to SPSO 2011
  • Removed complicated bouncing code due to box constraints and instead implemented as described in SPSO 2011
  • Calculating neighbor best has been changed to use personal best
  • Avoiding local and global particle update and instead relying on neighborbest
  • More randomization during velocity update by using a separate random numbers per dimension
  • Reusing problem specific solution creator in RealVectorParticleCreator instead of always using UniformRandomRealVectorCreator
File size: 3.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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 HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Encodings.RealVectorEncoding {
29  [StorableClass]
30  [Item("RealVector", "Represents a vector of real values.")]
31  public class RealVector : DoubleArray {
32    [StorableConstructor]
33    protected RealVector(bool deserializing) : base(deserializing) { }
34    protected RealVector(RealVector original, Cloner cloner) : base(original, cloner) { }
35    public RealVector() : base() { }
36    public RealVector(int length) : base(length) { }
37    public RealVector(int length, IRandom random, double min, double max)
38      : this(length) {
39      Randomize(random, min, max);
40    }
41    public RealVector(double[] elements) : base(elements) { }
42    public RealVector(DoubleArray elements)
43      : this(elements.Length) {
44      for (int i = 0; i < array.Length; i++)
45        array[i] = elements[i];
46    }
47
48    public override IDeepCloneable Clone(Cloner cloner) {
49      return new RealVector(this, cloner);
50    }
51
52    public virtual void Randomize(IRandom random, int startIndex, int length, double min, double max) {
53      double delta = max - min;
54      if (length > 0) {
55        for (int i = 0; i < length; i++)
56          array[startIndex + i] = min + delta * random.NextDouble();
57        OnReset();
58      }
59    }
60
61    public virtual void Randomize(IRandom random, int startIndex, int length, DoubleMatrix bounds) {
62      if (length > 0) {
63        for (int i = startIndex; i < startIndex + length; i++) {
64          double min = bounds[i % bounds.Rows, 0];
65          double max = bounds[i % bounds.Rows, 1];
66          array[i] = min + (max - min) * random.NextDouble();
67        }
68        OnReset();
69      }
70    }
71
72    public void Randomize(IRandom random, double min, double max) {
73      Randomize(random, 0, Length, min, max);
74    }
75
76    public void Randomize(IRandom random, DoubleMatrix bounds) {
77      Randomize(random, 0, Length, bounds);
78    }
79
80    public double DotProduct(RealVector other) {
81      if (other.Length != Length) throw new ArgumentException("Vectors are of unequal length.");
82      var dotProd = 0.0;
83      for (var i = 0; i < Length; i++)
84        dotProd += this[i] * other[i];
85      return dotProd;
86    }
87  }
88}
Note: See TracBrowser for help on using the repository browser.