charlie 0.5.0 → 0.6.0

metadata

@@ -1,33 +1,42 @@
 --- !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: 
+  version: 0.6.0
 platform: ruby
-signing_key: 
-cert_chain: 
-post_install_message: 
 authors: 
 - Sander Land
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2007-12-26 00:00:00 +01:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.4.0
+    version: 
+description: "== DESCRIPTION: Charlie is a library for genetic algorithms (GA) and genetic programming (GP).  == FEATURES: - Quickly develop GAs by combining several parts (genotype, selection, crossover, mutation) provided by the library. - Sensible defaults are provided with any genotype, so often you only need to define a fitness function. - Easily replace any of the parts by your own code. - Test different strategies in GA, and generate reports comparing them.  Example report: http://charlie.rubyforge.org/example_report.html  == EXAMPLES: This example solves a TSP problem (also quiz #142): N=5 CITIES = (0...N).map{|i| (0...N).map{|j| [i,j] } }.inject{|a,b|a+b} class TSP < PermutationGenotype(CITIES.size) def fitness d=0 (genes + [genes[0]]).each_cons(2){|a,b|  a,b=CITIES[a],CITIES[b] d += Math.sqrt( (a[0]-b[0])**2 + (a[1]-b[1])**2 )  } -d # lower distance -> higher fitness. end use EdgeRecombinationCrossover, InversionMutator end Population.new(TSP,20).evolve_on_console(50)  This example finds a polynomial which approximates cos(x) class Cos < TreeGenotype([proc{3*rand-1.5},:x], [:+,:*,:-], [:-@]) def fitness -[0,0.33,0.66,1].map{|x| (eval_genes(:x=>x) - Math.cos(x)).abs }.max end use TournamentSelection(4) end Population.new(Cos).evolve_on_console(500)"
+email: sander.land+ruby@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- README.txt
+- TODO.txt
+- data/GENOTYPE
+- data/SELECTION
+- data/CROSSOVER
+- data/MUTATION
+- data/BENCHMARK
 files: 
 - History.txt
 - Manifest.txt
@@ -46,6 +55,7 @@ files:
 - examples/gladiatorial_simple.rb
 - examples/gladiatorial_sunburn.rb
 - examples/gridwalk.rb
+- examples/money.rb
 - examples/output/flattened_sombero.html
 - examples/output/flattened_sombero2_.html
 - examples/output/fopt1_dblopt.html
@@ -61,6 +71,7 @@ files:
 - examples/royalroad.rb
 - examples/royalroad2.rb
 - examples/simple_climb_hill2.rb
+- examples/tree.rb
 - examples/tsp.rb
 - examples/weasel.rb
 - lib/charlie.rb
@@ -75,41 +86,49 @@ files:
 - lib/charlie/permutation/permutation.rb
 - lib/charlie/population.rb
 - lib/charlie/selection.rb
+- lib/charlie/tree/tree.rb
 - test/t_common.rb
-- test/test_basic.rb
 - test/test_benchmark.rb
 - test/test_cross.rb
+- test/test_evolve.rb
 - test/test_mutator.rb
 - test/test_permutation.rb
 - test/test_sel.rb
+- test/test_tree.rb
+has_rdoc: true
+homepage: http://charlie.rubyforge.org
+post_install_message: 
+rdoc_options: 
+- --main
+- README.txt
+- --inline-source
+- --line-numbers
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: charlie
+rubygems_version: 1.0.1
+signing_key: 
+specification_version: 2
+summary: A genetic algorithms library for Ruby.
 test_files: 
 - test/test_mutator.rb
 - test/test_cross.rb
+- test/test_evolve.rb
 - test/test_sel.rb
-- test/test_basic.rb
 - test/test_benchmark.rb
+- test/test_tree.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: 

data/test/test_basic.rb

@@ -1,32 +0,0 @@
-require 't_common'
-
-class BasicTest < Test::Unit::TestCase
-  def test_console
-    r = Population.new(TestProblem,10).evolve_on_console(10)
-    assert_respond_to r, :[]
-    assert_respond_to r[-1], :fitness
-  end
-
-  def test_silent
-    r = Population.new(TestProblem,10).evolve_silent(10)
-    assert_respond_to r, :[]
-    assert_respond_to r[-1], :fitness
-  end
-
-  def test_continue
-    p = Population.new(TestProblem,10)
-    best3  = p.evolve_silent(3)[-1].fitness
-    best33 = p.evolve_silent(30)[-1].fitness
-    # Not true for all problems, but in this case the probability of failure is negligible
-    assert( best33 > best3, "test_continue failed. Please rerun test to make sure this isn't just extremely bad luck.")
-  end
-
-  def test_testclass
-    assert_nothing_raised{
-     Population.new(TestClass(Module::new),10).evolve_silent(10)
-     Population.new(TestClass(UniformCrossover),10).evolve_silent(10)
-     Population.new(TestClass(ListMutator(:single_point,:gaussian) ),10).evolve_silent(10)
-     Population.new(TestClass(TournamentSelection(4)),10).evolve_silent(10)
-    }
-  end
-end