source: trunk/sources/HeuristicLab.Algorithms.ParticleSwarmOptimization/3.3/RandomTopologyInitializer.cs @ 15091

Last change on this file since 15091 was 15091, checked in by abeham, 3 years 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.2 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.Collections.Generic;
23using System.Linq;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Algorithms.ParticleSwarmOptimization {
32  [Item("Random Topology Initializer", "Randomly connectes every particle with k other particles.")]
33  [StorableClass]
34  public sealed class RandomTopologyInitializer : TopologyInitializer, IStochasticOperator {
35    #region Parameters
36    public ILookupParameter<IRandom> RandomParameter {
37      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
38    }
39    public IValueLookupParameter<IntValue> NrOfConnectionsParameter {
40      get { return (IValueLookupParameter<IntValue>)Parameters["NrOfConnections"]; }
41    }
42    #endregion
43   
44    #region Construction & Cloning
45    [StorableConstructor]
46    private RandomTopologyInitializer(bool deserializing) : base(deserializing) { }
47    private RandomTopologyInitializer(RandomTopologyInitializer original, Cloner cloner) : base(original, cloner) { }
48    public RandomTopologyInitializer() {
49      Parameters.Add(new LookupParameter<IRandom>("Random", "A random number generation."));
50      Parameters.Add(new ValueLookupParameter<IntValue>("NrOfConnections", "Nr of connected neighbors.", new IntValue(3)));
51    }
52
53    public override IDeepCloneable Clone(Cloner cloner) {
54      return new RandomTopologyInitializer(this, cloner);
55    }
56    #endregion
57
58    public override IOperation Apply() {
59      var random = RandomParameter.ActualValue;
60      var swarmSize = SwarmSizeParameter.ActualValue.Value;
61      var nrOfConnections = NrOfConnectionsParameter.ActualValue.Value;
62
63      ItemArray<IntArray> neighbors = new ItemArray<IntArray>(swarmSize);
64      for (int i = 0; i < swarmSize; i++) {
65        var numbers = Enumerable.Range(0, swarmSize).ToList();
66        numbers.RemoveAt(i);
67        var selectedNumbers = new List<int>(nrOfConnections);
68        for (int j = 0; j < nrOfConnections && numbers.Count > 0; j++) {
69          int index = random.Next(numbers.Count);
70          selectedNumbers.Add(numbers[index]);
71          numbers.RemoveAt(index);
72        }
73        neighbors[i] = new IntArray(selectedNumbers.ToArray());
74      }
75      NeighborsParameter.ActualValue = neighbors;
76      return base.Apply();
77    }
78  }
79}
Note: See TracBrowser for help on using the repository browser.