Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 15306 was 15214, checked in by abeham, 7 years ago

#2797:

  • Fixed adaptive random topology updater
  • Adapted default values of the best attraction parameters
  • Changed code of the new topology initializer
  • Fixed the parameters of the SPSO particle updaters (c parameter is actually (personal|neighbor)bestattraction), reordered the method signature and provided defaults
  • Removed the max beyond parameter again
  • Updated the sample and updated the unit test
    • In the sample no inertia updating is used, but the topology initializers / updaters of SPSO are used
File size: 3.3 KB
RevLine 
[5209]1#region License Information
2/* HeuristicLab
[14185]3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[5209]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;
[15091]27using HeuristicLab.Optimization;
[5209]28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
[5435]30
[5209]31namespace HeuristicLab.Algorithms.ParticleSwarmOptimization {
[15214]32  [Item("Random Distinct Topology Initializer", "Each particle is informed by exactly k+1 distinct other particles (including itself).")]
[5316]33  [StorableClass]
[15091]34  public sealed class RandomTopologyInitializer : TopologyInitializer, IStochasticOperator {
[5209]35    #region Parameters
[5410]36    public ILookupParameter<IRandom> RandomParameter {
37      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
[5209]38    }
[5410]39    public IValueLookupParameter<IntValue> NrOfConnectionsParameter {
40      get { return (IValueLookupParameter<IntValue>)Parameters["NrOfConnections"]; }
[5209]41    }
42    #endregion
[15091]43   
[5209]44    #region Construction & Cloning
[5435]45    [StorableConstructor]
46    private RandomTopologyInitializer(bool deserializing) : base(deserializing) { }
47    private RandomTopologyInitializer(RandomTopologyInitializer original, Cloner cloner) : base(original, cloner) { }
[5209]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    }
[5435]52
[5209]53    public override IDeepCloneable Clone(Cloner cloner) {
54      return new RandomTopologyInitializer(this, cloner);
55    }
56    #endregion
57
58    public override IOperation Apply() {
[15091]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();
[5209]66        numbers.RemoveAt(i);
[15181]67        var selectedNumbers = new List<int>(nrOfConnections + 1);
68        selectedNumbers.Add(i);
[15091]69        for (int j = 0; j < nrOfConnections && numbers.Count > 0; j++) {
70          int index = random.Next(numbers.Count);
[5209]71          selectedNumbers.Add(numbers[index]);
72          numbers.RemoveAt(index);
73        }
[5560]74        neighbors[i] = new IntArray(selectedNumbers.ToArray());
[5209]75      }
[15091]76      NeighborsParameter.ActualValue = neighbors;
[5209]77      return base.Apply();
78    }
79  }
80}
Note: See TracBrowser for help on using the repository browser.