Algorithmically 0.1.6 → 0.1.7

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c6b37344d80011486740e722946df13475c44ba5
-  data.tar.gz: 46afbc8274889d7660acf6fd42f5e3e78260851e
+  metadata.gz: 7c3ff69c1deb1ef40a3b013235db5301c5fabe69
+  data.tar.gz: 079f3e9fa0f0855bbdff52e73d6047e5a1c8e56d
 SHA512:
-  metadata.gz: 1831736b94dc14f2234ebfe1c2ca1c3c33f9d1ff301dd81f070c97bce781e517e38929ba6579467f60fda7093f3d267aa71fc28736850f97ae42c9775c4c75e0
-  data.tar.gz: a68582cd9aebbb76d27b047643d5160ba6ce1e352e45299512088dfcfbc326d5a8a2f22b58d21006098b1af2b9cdc7701210c7eb481294af92b99504e71e7066
+  metadata.gz: 39a4454297e4961ba194fecad4c33c03447b00e702e5411251ccc43dd966fee3d0159af90ad6b9f3887a19788b702427d9239f8ba44b615be9b2e96f35f3cdd1
+  data.tar.gz: 3bf6a86a8e384a28438e38ab15cf3d00626fcd38c3cc7b91326b079ee6bb3812eee3f741cffa8e0b3b694f16c97ec0923ed58a1fb046640e59eae3c034a30195

data/README.md

@@ -38,4 +38,8 @@ Or install it yourself as:
     
     Algorithmically::Neural::GuidedLocalSearch.new(150, [[565,575],[25,185],[345,750],[945,685]], 20, 0.3)
 
+### Swarm Algorithms
+
+    Algorithmically::Swarm::ParticleSwarm.new(2, 100, 1000, 1000, 50, 100.0, 2.0, 2.0)
+
 

data/lib/Algorithmically.rb

@@ -4,10 +4,12 @@ require 'Algorithmically/Neural/perceptron'
 require 'Algorithmically/Stochastic/random_search'
 require 'Algorithmically/Stochastic/hill_climbing'
 require 'Algorithmically/Stochastic/guided_local_search'
+require 'Algorithmically/Swarm/particle_swarm'
 
 
 module Algorithmically
   include Evolutionary
   include Neural
   include Stochastic
+  include Swarm
 end

data/lib/Algorithmically/Swarm/particle_swarm.rb

@@ -0,0 +1,93 @@
+module Algorithmically
+  module Swarm
+
+    class ParticleSwarm
+
+      def initialize(problem_size, max_gens, search_space, vel_space, pop_size, max_vel, c1, c2)
+        @search_space, @vel_space = search_space, vel_space
+        @search_space = Array.new(problem_size) {|i| [-5, 5]}
+        @vel_space = Array.new(problem_size) {|i| [-1, 1]}
+        best = search(max_gens, @search_space, @vel_space, pop_size, max_vel, c1, c2)
+        puts "done! Solution: f=#{best[:cost]}, s=#{best[:position].inspect}"
+      end
+
+      def objective_function(vector)
+        vector.inject(0.0) { |sum, x| sum + (x ** 2.0) }
+      end
+
+      def random_vector(minmax)
+        Array.new(minmax.size) do |i|
+          minmax[i][0] + ((minmax[i][1] - minmax[i][0]) * rand())
+        end
+      end
+
+      def create_particle(search_space, vel_space)
+        particle = {}
+        particle[:position] = random_vector(search_space)
+        particle[:cost] = objective_function(particle[:position])
+        particle[:b_position] = Array.new(particle[:position])
+        particle[:b_cost] = particle[:cost]
+        particle[:velocity] = random_vector(vel_space)
+        particle
+      end
+
+      def get_global_best(population, current_best=nil)
+        population.sort! { |x, y| x[:cost] <=> y[:cost] }
+        best = population.first
+        if current_best.nil? or best[:cost] <= current_best[:cost]
+          current_best = {}
+          current_best[:position] = Array.new(best[:position])
+          current_best[:cost] = best[:cost]
+        end
+        current_best
+      end
+
+      def update_velocity(particle, gbest, max_v, c1, c2)
+        particle[:velocity].each_with_index do |v, i|
+          v1 = c1 * rand() * (particle[:b_position][i] - particle[:position][i])
+          v2 = c2 * rand() * (gbest[:position][i] - particle[:position][i])
+          particle[:velocity][i] = v + v1 + v2
+          particle[:velocity][i] = max_v if particle[:velocity][i] > max_v
+          particle[:velocity][i] = -max_v if particle[:velocity][i] < -max_v
+        end
+      end
+
+      def update_position(part, bounds)
+        part[:position].each_with_index do |v, i|
+          part[:position][i] = v + part[:velocity][i]
+          if part[:position][i] > bounds[i][1]
+            part[:position][i]=bounds[i][1]-(part[:position][i]-bounds[i][1]).abs
+            part[:velocity][i] *= -1.0
+          elsif part[:position][i] < bounds[i][0]
+            part[:position][i]=bounds[i][0]+(part[:position][i]-bounds[i][0]).abs
+            part[:velocity][i] *= -1.0
+          end
+        end
+      end
+
+      def update_best_position(particle)
+        return if particle[:cost] > particle[:b_cost]
+        particle[:b_cost] = particle[:cost]
+        particle[:b_position] = Array.new(particle[:position])
+      end
+
+      def search(max_gens, search_space, vel_space, pop_size, max_vel, c1, c2)
+        pop = Array.new(pop_size) { create_particle(search_space, vel_space) }
+        gbest = get_global_best(pop)
+        max_gens.times do |gen|
+          pop.each do |particle|
+            update_velocity(particle, gbest, max_vel, c1, c2)
+            update_position(particle, search_space)
+            particle[:cost] = objective_function(particle[:position])
+            update_best_position(particle)
+          end
+          gbest = get_global_best(pop, gbest)
+          puts " > gen #{gen+1}, fitness=#{gbest[:cost]}"
+        end
+        gbest
+      end
+
+    end
+
+  end
+end

data/lib/Algorithmically/version.rb

@@ -1,3 +1,3 @@
 module Algorithmically
-  VERSION = '0.1.6'
+  VERSION = '0.1.7'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: Algorithmically
 version: !ruby/object:Gem::Version
-  version: 0.1.6
+  version: 0.1.7
 platform: ruby
 authors:
 - popac
@@ -82,6 +82,7 @@ files:
 - lib/Algorithmically/Stochastic/guided_local_search.rb
 - lib/Algorithmically/Stochastic/hill_climbing.rb
 - lib/Algorithmically/Stochastic/random_search.rb
+- lib/Algorithmically/Swarm/particle_swarm.rb
 - lib/Algorithmically/version.rb
 homepage: https://github.com/popac/Algorithmically
 licenses: