Algorithmically 0.1.4 → 0.1.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 553511b544e3ba3256109470cec9aa74afacf883
-  data.tar.gz: 7c369687176d34c9105f30f068592b92ff8a8247
+  metadata.gz: 90dbca96e9a153e6acfbdd2eac99f9e06054aa73
+  data.tar.gz: a1a059aab483649dae1d890df74549a20cda0b42
 SHA512:
-  metadata.gz: 69b85819ba8ba9e9f51c009263a2f66080977bf98bc71a7a4d92c98e54a654f1b0ead68adc6fc8e6955bc8312d4ed33f9fc8d37643fd5e8f947b69d8aafd1f79
-  data.tar.gz: eace3c0a9fd63ee2d635cff1a3dc018a4b4a9dcf214d9d743445ea8a61cdcb285ce4417f633606d750e321157fa1c7b95a516ec4529e79a7d81ce0f907dc64da
+  metadata.gz: 9afc0731375aa0fae820aa4605b87ce7992f484430faaf0c1eabba5fa91eaf785c36457e4613c2c622e51078667a3ecec57f519243114cd3a0e7765e0c3f4029
+  data.tar.gz: 7d30e282bc64b82fe5683b33308e218cea14ed76100841f314fc3a02ab14c4399a8faa62ed9e4c5aee866ac4acee44fb37cb1124ca513d1846225cf32fb2a541

data/README.md

@@ -20,6 +20,10 @@ Or install it yourself as:
     
 ## Usage
 
+### Evolutionary Algorithms
+
+    Algorithmically::Genetic.new(100, 64, 100, 0.98)
+
 ### Neural Algorithms
 
     Algorithmically::Perceptron.new([[0,0,0], [0,1,1], [1,0,1], [1,1,1]], 2, 20, 0.1)

data/lib/Algorithmically.rb

@@ -1,4 +1,5 @@
 require 'Algorithmically/version'
+require 'Algorithmically/Evolutionary/genetic'
 require 'Algorithmically/Neural/perceptron'
 require 'Algorithmically/Stochastic/random_search'
 require 'Algorithmically/Stochastic/hill_climbing'
@@ -6,6 +7,7 @@ require 'Algorithmically/Stochastic/guided_local_search'
 
 
 module Algorithmically
+  include Evolutionary
   include Neural
   include Stochastic
 end

data/lib/Algorithmically/Evolutionary/genetic.rb

@@ -0,0 +1,77 @@
+module Evolutionary
+
+  class Genetic
+
+    def initialize(max_gens, num_bits, pop_size, p_crossover)
+      p_mutation = 1.0/num_bits
+      best = search(max_gens, num_bits, pop_size, p_crossover, p_mutation)
+      puts "done! Solution: f=#{best[:fitness]}, s=#{best[:bitstring]}"
+    end
+
+    def onemax(bitstring)
+      sum = 0
+      bitstring.size.times { |i| sum+=1 if bitstring[i].chr=='1' }
+      sum
+    end
+
+    def random_bitstring(num_bits)
+      (0...num_bits).inject("") { |s, i| s<<((rand<0.5) ? "1" : "0") }
+    end
+
+    def binary_tournament(pop)
+      i, j = rand(pop.size), rand(pop.size)
+      j = rand(pop.size) if j==i
+      (pop[i][:fitness] > pop[j][:fitness]) ? pop[i] : pop[j]
+    end
+
+    def point_mutation(bitstring, rate=1.0/bitstring.size)
+      child = ""
+      bitstring.size.times do |i|
+        bit = bitstring[i].chr
+        child << ((rand()<rate) ? ((bit=='1') ? "0" : "1") : bit)
+      end
+      child
+    end
+
+    def crossover(parent1, parent2, rate)
+      ""+parent1 if rand()>=rate
+      point = 1 + rand(parent1.size-2)
+      parent1[0...point]+parent2[point...(parent1.size)]
+    end
+
+    def reproduce(selected, pop_size, p_cross, p_mutation)
+      children = []
+      selected.each_with_index do |p1, i|
+        p2 = (i.modulo(2)==0) ? selected[i+1] : selected[i-1]
+        p2 = selected[0] if i == selected.size-1
+        child = {}
+        child[:bitstring] = crossover(p1[:bitstring], p2[:bitstring], p_cross)
+        child[:bitstring] = point_mutation(child[:bitstring], p_mutation)
+        children << child
+        children.size >= pop_size
+      end
+      children
+    end
+
+    def search(max_gens, num_bits, pop_size, p_crossover, p_mutation)
+      population = Array.new(pop_size) do |i|
+        {:bitstring => random_bitstring(num_bits)}
+      end
+      population.each { |c| c[:fitness] = onemax(c[:bitstring]) }
+      best = population.sort { |x, y| y[:fitness] <=> x[:fitness] }.first
+      max_gens.times do |gen|
+        selected = Array.new(pop_size) { |i| binary_tournament(population) }
+        children = reproduce(selected, pop_size, p_crossover, p_mutation)
+        children.each { |c| c[:fitness] = onemax(c[:bitstring]) }
+        children.sort! { |x, y| y[:fitness] <=> x[:fitness] }
+        best = children.first if children.first[:fitness] >= best[:fitness]
+        population = children
+        puts " > gen #{gen}, best: #{best[:fitness]}, #{best[:bitstring]}"
+        break best[:fitness] == num_bits
+      end
+      best
+    end
+
+  end
+
+end

data/lib/Algorithmically/version.rb

@@ -1,3 +1,3 @@
 module Algorithmically
-  VERSION = '0.1.4'
+  VERSION = '0.1.5'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: Algorithmically
 version: !ruby/object:Gem::Version
-  version: 0.1.4
+  version: 0.1.5
 platform: ruby
 authors:
 - popac
@@ -76,6 +76,7 @@ files:
 - bin/console
 - bin/setup
 - lib/Algorithmically.rb
+- lib/Algorithmically/Evolutionary/genetic.rb
 - lib/Algorithmically/Neural/perceptron.rb
 - lib/Algorithmically/Stochastic/adaptive_random_search.rb
 - lib/Algorithmically/Stochastic/guided_local_search.rb