charlie 0.5.0

data/test/test_mutator.rb

@@ -0,0 +1,44 @@
+require 't_common'
+
+ms = [:single_point,:single_point[],[:single_point],:n_point,:n_point[],:n_point[3],:expected_n,:expected_n[1],:probability,:probability[0.3]]
+pm = [:gaussian,:gaussian[],:gaussian[0.25],:uniform,:uniform[0.1],:flip,:replace[0.2,0.1,0.0,-0.1,-0.2]]
+$mut_mth = [NullMutator]
+ms.each{|m| pm.each{|p| $mut_mth << ListMutator(m,p) } }
+
+
+class TestMutator < Test::Unit::TestCase
+  def test_mutate
+    $mut_mth.each{|m|
+      klass = TestClass(m)
+      assert_nothing_raised("#{m} failed") { Population.new(klass,10).evolve_silent(10) }
+    }
+  end
+
+  def test_bit
+    klass = TestClass(ListMutator(:single_point,:flip),RoyalRoad)
+    p = nil
+    assert_nothing_raised{ p=Population.new(klass,10).evolve_silent(10) }
+    assert p.all?{|s| s.genes.all?{|x| x==0 || x==1 }}
+    klass = TestClass(ListMutator(:expected_n[100],:replace[0,1]),RoyalRoad)
+    assert_nothing_raised{ p=Population.new(klass,10).evolve_silent(10) }
+    assert p.all?{|s| s.genes.all?{|x| x==0 || x==1 }}
+  end
+
+  def test_str
+    klass = TestClass(ListMutator(:single_point,:replace['a','b']),StringA)
+    p = nil
+    assert_nothing_raised{ p=Population.new(klass,10).evolve_silent(10) }
+    assert p.all?{|s| s.genes.all?{|x| ('a'..'d')===x }}
+    
+    klass = TestClass(ListMutator(:single_point,:replace['z','x']),StringA)
+    assert_nothing_raised{ p=Population.new(klass,10).evolve_silent(10) }
+    assert p.all?{|s| s.genes.all?{|x| ['a','b','c','d','x','z'].include? x }}
+  end
+
+  def test_pmutate
+    klass = TestClass(PMutate(0.5,ListMutator(:single_point,:replace['a','b'])),StringA)
+    p = nil
+    assert_nothing_raised{ p=Population.new(klass,10).evolve_silent(10) }
+    assert p.all?{|s| s.genes.all?{|x| ('a'..'d')===x }}
+  end
+end

data/test/test_permutation.rb

@@ -0,0 +1,23 @@
+require 't_common'
+
+N=10
+
+#CITIES = (0...N).map{|i| th = i * 2 * Math::PI / N; [Math.cos(th),Math.sin(th)] }
+#p CITIES
+
+class PermutationTest < PermutationGenotype(N)
+  def fitness
+    (0...N).zip_with(genes){|a,b| a==b ? 1 : 0}.sum
+  end
+end
+
+
+class PermTests < Test::Unit::TestCase
+  def test_evolve
+    p=nil
+    assert_nothing_raised{
+      p=Population.new(PermutationTest,20).evolve_silent(20)
+    }
+    p.each{|s| assert_equal s.genes.sort, (0...N).to_a }
+  end
+end

data/test/test_sel.rb

@@ -0,0 +1,39 @@
+require 't_common'
+
+#ObjectSpace.each_object(Module){|m|
+#  $sel_mth << m if m.instance_methods.include?('next_generation')
+#}
+#p $sel_mth
+$sel_mth = [RouletteSelection, RandomSelection]
+
+$sel_mth += [TournamentSelection(3),TournamentSelection(4,1),TournamentSelection(8,30),
+             TruncationSelection(0.0),TruncationSelection(0.3),TruncationSelection(1), TruncationSelection(6),
+             ScaledRouletteSelection(), ScaledRouletteSelection{|i| 2*i+1 }, ScaledRouletteSelection{|i| i<10 ? 1 : i }
+            ]
+             
+$sel_mth = $sel_mth.uniq
+
+class TestSelection < Test::Unit::TestCase
+  def test_selection
+    $sel_mth.each{|s|
+      klass = TestClass(s)
+      assert_nothing_raised{ Population.new(klass,10).evolve_silent(10) }
+    }
+  end
+
+  def test_elitism
+    $sel_mth.map{|s| Elitism(s,rand(4))  }.each{|s|
+      klass = TestClass(s)
+      assert_nothing_raised{ Population.new(klass,10).evolve_silent(10) }
+    }
+  end
+
+  def test_singlechild
+    scc = TestClass(SingleChild(NullCrossover))
+    $sel_mth.each{|s|
+      klass = TestClass(s,scc)
+      assert_nothing_raised{ Population.new(klass,10).evolve_silent(10) }
+    }
+  end
+
+end

metadata

@@ -0,0 +1,115 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.9.4
+specification_version: 1
+name: charlie
+version: !ruby/object:Gem::Version 
+  version: 0.5.0
+date: 2007-12-19 00:00:00 +01:00
+summary: A genetic algorithms library for Ruby.
+require_paths: 
+- lib
+email: sander.land+ruby@gmail.com
+homepage: http://charlie.rubyforge.org
+rubyforge_project: charlie
+description: "== DESCRIPTION: Charlie is a library for genetic algorithms. It allows you to easily create and run genetic algorithms. You can choose selection, crossover or mutation  strategies from either built-in options or simply write your own. It also includes methods that can be used to compare several of these  strategies, generating reports with statistics that can be used to determine  which one to use in future problems.  == EXAMPLES: This example finds the binary representation of the number 512. require 'rubygems' require 'charlie' class Find512 < BitStringGenotype(10) # choose a genotype, in this case a list of 10 bits represents a solution # Define a fitness function. This one returns minus the offset to the best solution, so a higher number is better. # Usually, you won't know the best solution, and will define this as some value that needs to be maximized. def fitness   # Use the 'genes' function to retrieve the array of bits representing this solution. -(genes.map(&:to_s).join.to_i(2) - 512).abs end end # Finally, create an instance of a population (with the default size of 20) and let it run for the default number of 100 generations. Population.new(Find512).evolve_on_console"
+autorequire: 
+default_executable: 
+bindir: bin
+has_rdoc: true
+required_ruby_version: !ruby/object:Gem::Version::Requirement 
+  requirements: 
+  - - ">"
+    - !ruby/object:Gem::Version 
+      version: 0.0.0
+  version: 
+platform: ruby
+signing_key: 
+cert_chain: 
+post_install_message: 
+authors: 
+- Sander Land
+files: 
+- History.txt
+- Manifest.txt
+- README.txt
+- Rakefile
+- TODO.txt
+- data/BENCHMARK
+- data/CROSSOVER
+- data/GENOTYPE
+- data/MUTATION
+- data/SELECTION
+- data/template.html
+- examples/bit.rb
+- examples/function_opt_2peak.rb
+- examples/function_opt_sombero.rb
+- examples/gladiatorial_simple.rb
+- examples/gladiatorial_sunburn.rb
+- examples/gridwalk.rb
+- examples/output/flattened_sombero.html
+- examples/output/flattened_sombero2_.html
+- examples/output/fopt1_dblopt.html
+- examples/output/hill10.html
+- examples/output/hill2.csv
+- examples/output/hill2.html
+- examples/output/royalroad1_report.html
+- examples/output/royalroad2_report.html
+- examples/output/royalroadquick_report.html
+- examples/output/tsp.html
+- examples/output/weasel1_report.html
+- examples/output/weasel2_report.html
+- examples/royalroad.rb
+- examples/royalroad2.rb
+- examples/simple_climb_hill2.rb
+- examples/tsp.rb
+- examples/weasel.rb
+- lib/charlie.rb
+- lib/charlie/crossover.rb
+- lib/charlie/etc/minireport.rb
+- lib/charlie/etc/monkey.rb
+- lib/charlie/genotype.rb
+- lib/charlie/list/list_crossover.rb
+- lib/charlie/list/list_genotype.rb
+- lib/charlie/list/list_mutate.rb
+- lib/charlie/mutate.rb
+- lib/charlie/permutation/permutation.rb
+- lib/charlie/population.rb
+- lib/charlie/selection.rb
+- test/t_common.rb
+- test/test_basic.rb
+- test/test_benchmark.rb
+- test/test_cross.rb
+- test/test_mutator.rb
+- test/test_permutation.rb
+- test/test_sel.rb
+test_files: 
+- test/test_mutator.rb
+- test/test_cross.rb
+- test/test_sel.rb
+- test/test_basic.rb
+- test/test_benchmark.rb
+- test/test_permutation.rb
+rdoc_options: 
+- --main
+- README.txt
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- README.txt
+- TODO.txt
+executables: []
+
+extensions: []
+
+requirements: []
+
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Version::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.3.0
+    version: