[3742] | 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 |
|
---|
[5034] | 22 | using HeuristicLab.Common;
|
---|
[4068] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
[5033] | 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[3682] | 26 |
|
---|
| 27 | namespace HeuristicLab.Algorithms.ParticleSwarmOptimization {
|
---|
[5034] | 28 |
|
---|
[5316] | 29 | [Item("Totally Connected Particle Updater", "Updates the particle's position using (among other things) the global best position. Use together with the empty topology initialzer. Point = Point + Velocity*Omega + (PersonalBestPoint-Point)*Phi_P*r_p + (BestPoint-Point)*Phi_G*r_g")]
|
---|
[5034] | 30 | [StorableClass]
|
---|
[5342] | 31 | public class TotallyConnectedParticleUpdater : ParticleUpdater, IGlobalParticleUpdater {
|
---|
[5033] | 32 |
|
---|
| 33 | #region Construction & Cloning
|
---|
| 34 |
|
---|
| 35 | [StorableConstructor]
|
---|
[5209] | 36 | protected TotallyConnectedParticleUpdater(bool deserializing) : base(deserializing) { }
|
---|
| 37 | protected TotallyConnectedParticleUpdater(ParticleUpdater original, Cloner cloner) : base(original, cloner) { }
|
---|
| 38 | public TotallyConnectedParticleUpdater() : base() { }
|
---|
[5033] | 39 |
|
---|
| 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[5209] | 41 | return new TotallyConnectedParticleUpdater(this, cloner);
|
---|
[5033] | 42 | }
|
---|
| 43 |
|
---|
| 44 | #endregion
|
---|
| 45 |
|
---|
[3682] | 46 | public override IOperation Apply() {
|
---|
[5410] | 47 | base.Apply();
|
---|
[5033] | 48 | RealVector velocity = new RealVector(Velocity.Length);
|
---|
| 49 | RealVector position = new RealVector(Point.Length);
|
---|
| 50 | double r_p = Random.NextDouble();
|
---|
| 51 | double r_g = Random.NextDouble();
|
---|
[5410] | 52 | double omega = Omega.Value;
|
---|
| 53 | double phi_p = Phi_P.Value;
|
---|
| 54 | double phi_g = Phi_G.Value;
|
---|
[3682] | 55 | for (int i = 0; i < velocity.Length; i++) {
|
---|
[5033] | 56 | velocity[i] =
|
---|
[5410] | 57 | Velocity[i] * omega +
|
---|
| 58 | (PersonalBestPoint[i] - Point[i]) * phi_p * r_p +
|
---|
| 59 | (BestPoint[i] - Point[i]) * phi_g * r_g;
|
---|
[3682] | 60 | }
|
---|
[5033] | 61 | BoundsChecker.Apply(velocity, VelocityBounds);
|
---|
| 62 | for (int i = 0; i < velocity.Length; i++) {
|
---|
| 63 | position[i] = Point[i] + velocity[i];
|
---|
[3682] | 64 | }
|
---|
[5033] | 65 | BoundsChecker.Apply(position, Bounds);
|
---|
| 66 | Point = position;
|
---|
| 67 | Velocity = velocity;
|
---|
| 68 |
|
---|
[3682] | 69 | return base.Apply();
|
---|
| 70 | }
|
---|
| 71 | }
|
---|
| 72 | }
|
---|