rbga 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: d41bf1e0fb8bddb4244020a7a356e2ec90e43d8b
+  data.tar.gz: a151df0070b724322415b22e3207e551d8a5b49c
+SHA512:
+  metadata.gz: 988d8801e58c49ac2b4cb94712d2e8c4777842ab0a873022a963cff6fec116b9daf9292c5b0dc8f609b784280559f69aacb6e14216351fa0b7e0c1027a80ddfa
+  data.tar.gz: cf709f516bf034ac621f96510902d6b6b06d8813da2ad753a050e7d301addd2f0a06909020f99271fd751f4e15ee88e9fa91add2bff4e42b8bd6bcd46025fe17

data/LICENSE

@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright (c) 2013 Szu-Kai Hsu (brucehsu)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/lib/chromosome_type.rb

@@ -0,0 +1,6 @@
+module ChromosomeType
+    def permutation
+        @size.times {|i| self << i }
+        shuffle!
+    end
+end

data/lib/crossover_methods.rb

@@ -0,0 +1,35 @@
+module CrossoverMethods
+    def order_crossover(chs1, chs2)
+        idx = rand(chs1.size/2)
+        new_chs1 = Chromosome.new(@chromosome_type, chs1.size, @mutation_method, @mutation_probability)
+        new_chs1.clear
+        new_chs1 << chs1[idx..(idx+chs1.size/2)]
+        new_chs1.flatten!
+        new_chs2 = Chromosome.new(@chromosome_type, chs1.size, @mutation_method, @mutation_probability)
+        new_chs2.clear
+        new_chs2 << chs2[idx..(idx+chs2.size/2)]
+        new_chs2.flatten!
+
+        chs1.size.times do |i|
+            unless new_chs1.include? chs2[i]
+                if new_chs1.size<=(chs1.size*3/4)
+                    new_chs1.insert(0,chs2[i])
+                else
+                    new_chs1.push(chs2[i])
+                end
+            end
+        end
+
+        chs2.size.times do |i|
+            unless new_chs2.include? chs1[i]
+                if new_chs2.size<=(chs2.size*3/4)
+                    new_chs2.insert(0,chs1[i])
+                else
+                    new_chs2.push(chs1[i])
+                end
+            end
+        end
+
+        return [new_chs1, new_chs2]
+    end
+end

data/lib/mutation_methods.rb

@@ -0,0 +1,20 @@
+module MutationMethods
+    def swap
+        idx1 = rand(self.size)
+        idx2 = rand(self.size)
+        while idx1==idx2
+            idx2 = rand(self.size)
+        end
+        self[idx1], self[idx2] = self[idx2], self[idx1]
+    end
+
+    def inversion
+        head = self.size/4
+        tail = self.size*3/4
+        while head<=tail
+            self[head], self[tail] = self[tail], self[head]
+            head+=1
+            tail-=1
+        end
+    end
+end

data/lib/rbga.rb

@@ -0,0 +1,148 @@
+require 'chromosome_type'
+require 'mutation_methods'
+require 'crossover_methods'
+require 'selection_methods'
+require 'survive_methods'
+
+class GA
+    attr_reader :best_log, :avg_log
+    include CrossoverMethods
+    include SelectionMethods
+    include SurviveMethods
+
+    def initialize(&block)
+        instance_eval &block
+        @population = Population.new @population_size, @chromosome_type, @chromosome_length, @mutation_method, @mutation_probability
+        @best_log = []
+        @avg_log = []
+    end
+
+    def chromosome_type(type)
+        @chromosome_type = type
+    end
+
+    def chromosome_length(len)
+        @chromosome_length = len
+    end
+
+    def population_size(size)
+        @population_size = size
+    end
+
+    def crossover_method(crossover)
+        @crossover_method = crossover
+    end
+
+    def mutation_method(mutation)
+        @mutation_method = mutation
+    end
+
+    def mutation_probability(prob)
+        @mutation_probability = prob
+    end
+
+    def selection_method(selection)
+        @selection_method = selection
+    end
+
+    def survive_method(survive)
+        @survive_method = survive
+    end
+
+    def evolve(generations)
+        generations.times do |i|
+            offspring = Population.new @population_size, @chromosome_type, @chromosome_length, @mutation_method, @mutation_probability
+            offspring.clear
+            offspring << @population
+            offspring.flatten!(1)
+            @population.size.times do |i|
+                chs1 = @population[select]
+                chs2 = @population[select]
+                while chs1==chs2
+                    chs2 = @population[select]
+                end
+                new_chs = crossover(chs1,chs2)
+                while offspring.include?(new_chs[0]) or offspring.include?(new_chs[1])
+                    chs1 = @population[select]
+                    chs2 = @population[select]
+                    while chs1==chs2
+                        chs2 = @population[select]
+                    end
+                    new_chs = crossover(chs1,chs2)
+                end
+                offspring << new_chs[0] << new_chs[1]
+            end
+            survive offspring
+            @best_log << best.fitness
+            @avg_log << avg
+        end
+
+    end
+
+    def select
+        send(@selection_method)
+    end
+
+    def crossover(chs1, chs2)
+        send(@crossover_method, chs1, chs2)
+    end
+
+    def set_fitness_eval(&block)
+        @fitness = block
+    end
+
+    def survive(population)
+        population.each { |e| e.fitness = @fitness.call e }
+        send(@survive_method, population)
+    end
+
+    def best
+        best_idx = 0
+        best_fit = nil
+        @population.each_index do |idx|
+            ch = @population[idx]
+            ch.fitness = @fitness.call ch
+            best_fit = ch.fitness if best_fit==nil
+            best_idx = idx if best_fit < ch.fitness
+            best_fit = ch.fitness if best_fit < ch.fitness
+        end
+        return @population[best_idx]
+    end
+
+    def avg
+        avg_fit = 0
+        @population.each do |ch|
+            avg_fit += ch.fitness
+        end
+        return avg_fit/@population.size
+    end
+    
+end
+
+class Population < Array
+    def initialize(size, chs_type, chs_len, chs_mutation, chs_prob)
+        return if size==nil
+        size.times do |i|
+            self << Chromosome.new(chs_type, chs_len, chs_mutation, chs_prob)
+        end
+    end
+end
+
+class Chromosome < Array
+    attr_accessor :fitness
+    include ChromosomeType
+    include MutationMethods
+
+    def initialize(type, size, mutation, probability)
+        @size = size
+        self.send(type)
+        @mutation_method = mutation
+        @mutation_probability = probability
+    end
+
+    def mutate!
+        if rand(100)<=probability
+            self.send(:mutation_method)
+        end
+    end
+end

data/lib/selection_methods.rb

@@ -0,0 +1,12 @@
+module SelectionMethods
+    def two_tournament
+      idx1 = rand(@population.size)
+      idx2 = rand(@population.size)
+      while idx1==idx2
+          idx2 = rand(@population.size)
+      end
+      @population[idx1].fitness = @fitness.call @population[idx1]
+      @population[idx2].fitness = @fitness.call @population[idx2]
+      return ((@population[idx1].fitness) < (@population[idx2].fitness)) ? idx1 : idx2  
+    end
+end

data/lib/survive_methods.rb

@@ -0,0 +1,11 @@
+module SurviveMethods
+    def min_fitness(population)
+        population.sort! { |a, b| a.fitness <=> b.fitness }
+        @population = population[0..(@population.size-1)]
+    end
+
+    def max_fitness(population)
+        population.sort! { |a, b| b.fitness <=> a.fitness }
+        @population = population[0..(@population.size-1)]
+    end
+end

metadata

@@ -0,0 +1,51 @@
+--- !ruby/object:Gem::Specification
+name: rbga
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Szu-Kai Hsu(brucehsu)
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-08-14 00:00:00.000000000 Z
+dependencies: []
+description: Providing an expressive DSL to illustrate genetic algorithm problems
+  and sets of default methods.
+email: brucehsu@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/chromosome_type.rb
+- lib/crossover_methods.rb
+- lib/mutation_methods.rb
+- lib/rbga.rb
+- lib/selection_methods.rb
+- lib/survive_methods.rb
+- LICENSE
+homepage: https://github.com/brucehsu/rbga
+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 Algorithm DSL
+test_files: []