evopop 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 0a7d88db7ef7db0308c1a1f78622124c40f3f556
+  data.tar.gz: 2367d81655b2112e858828bfd4e1d64fd4f4e44e
+SHA512:
+  metadata.gz: 0ff6289c46a13239cfc61267e42ee5c63980fc8d4aaef9073de188da6d6d7a92c4769bfff54db3315bcf8fa5ad0266f355385cca17cd594e662eb3863dbdf904
+  data.tar.gz: 9c461beb7fc05d35f824da3be0c487abe086c91357668ce08cbb47134491c558ec1e6a95ea6c194fb4f6eee9dd1f6dfe70822541e12da219ce13fcd46c114d6e

data/lib/evopop/candidate.rb

@@ -0,0 +1,10 @@
+# Public: Represents a candidate in the population. Candidates are abstracted
+# as a simple data structure which contains the DNA and fitness over the 
+# fitness function.
+class Candidate
+  attr_accessor :dna, :fitness
+
+  def initialize
+    @dna = []
+  end
+end

data/lib/evopop/population.rb

@@ -0,0 +1,95 @@
+
+# Public: Represents the population that is being trained. Has various methods
+# relevant to training.
+# 
+#
+# Examples
+#   population = Population.new
+#   ... initialize population with parameters ...
+#   population.train
+#   population.crossover
+#   population.mutate
+class Population
+  attr_accessor :candidates, :population_size, :max_generations, :initial_range_min, :initial_range_max, :mutation_range_min, :mutation_range_max, :mutation_num, :fitness_function, :dna_len, :average_fitness
+
+  # Initializes the attributes with default values. This is not guaranteed
+  # to reach maxima.
+  def initialize
+    @average_fitness = []
+    @population_size = 100
+    @max_generations = 100
+    @initial_range_min = -100
+    @initial_range_max = 100
+    @mutation_range_min = -10
+    @mutation_range_max = 10
+    @mutation_num = (0.10*@population_size).to_i
+    @dna_len = 1
+
+    @fitness_function = Proc.new { |dna|
+      Math.sin(dna[0])
+    }
+
+    self.create
+  end
+
+  # Public: Creates a new population class. Should be called after all the
+  # parameters have been set to the attributes.
+  def create
+    @candidates = Array.new(@population_size) {|c| 
+      candidate = Candidate.new
+      (0...@dna_len).each {
+        candidate.dna << Random.rand(@initial_range_min...@initial_range_max)
+      }
+      candidate
+    }
+  end
+
+  # Public: Determines the fitness of the population and thereafter sorts it
+  # based on fitness descdending (high fitness first, low fitness last).
+  def train
+    average_fitness = 0
+    @candidates.each { |c|
+      c.fitness = fitness_function.call(c.dna)
+      average_fitness = average_fitness + c.fitness
+    }
+    average_fitness = average_fitness/@population_size
+
+    @average_fitness << average_fitness
+
+    @candidates = @candidates.sort_by {|c| c.fitness}
+    @candidates = @candidates.reverse
+  end
+
+  # Public: Performs simple mechanism of crossover - in this case picks two
+  # random candidates in from a top percentile of the population and averages
+  # out their DNA per dimension, producing new offspring equal to the
+  # population size attribute.
+  def crossover
+    @candidates = @candidates.take((@population_size*0.75).to_i)
+    
+    new_generation = Array.new
+    (0...@population_size).each {|i|
+      couple = @candidates.sample(2)
+      child = Candidate.new
+      (0...@dna_len).each {|j|
+        child.dna << (couple[0].dna[j] + couple[1].dna[j])/2.0 # Initialize the dna of the child with the average of the parents' dna.
+      } 
+      new_generation << child 
+    }
+
+    @candidates = new_generation
+  end
+
+  # Public: Performs simple mutation over the next generation. In this case, 
+  # it either adds or substracts an amount to each dimension given the 
+  # mutation range attributes.
+  def mutate
+    mutated = @candidates.sample(self.mutation_num)
+
+    mutated.each { |c|
+      (0...@dna_len).each {|i|
+        c.dna[i] = c.dna[i] + Random.rand(@mutation_range_min...@mutation_range_max)
+      }
+    }
+  end
+end

data/lib/evopop.rb

@@ -0,0 +1,13 @@
+require 'evopop/population'
+require 'evopop/candidate'
+
+class Evopop
+
+  def self.Population 
+    Population
+  end
+
+  def self.Candidate
+    Candidate
+  end
+end

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: evopop
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Elvin Lucero
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-08-19 00:00:00.000000000 Z
+dependencies: []
+description: A simple library for implementing simple genetic algorithms.
+email: elvinlucero@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/evopop.rb
+- lib/evopop/population.rb
+- lib/evopop/candidate.rb
+homepage: https://github.com/elvinlucero/evopop
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.3
+signing_key: 
+specification_version: 4
+summary: Genetic algorithms!
+test_files: []