ruby-jgap 0.0.1-java

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: db26a50b8deeb21c693163a8fab9578fb2c37990
+  data.tar.gz: 552e7b2836d796b8d8baca0f7dbfb949ea6d77ec
+SHA512:
+  metadata.gz: f423e8b532b9bc6612129c9922ab6e020fc50b9e1892d75c17eda072d41c6d1eb25231f638546f291f8dc07f3e38896cc84453925b773211abc2b2a69fbd149d
+  data.tar.gz: 2a86fe2c6293ea8167313676ccc3cdeba541675bcb4e3145cdc94969159a6975a3a4ec2abe4dcd2232c036bccf2d2ab13797acc569bdeba5c1af3dc43cb3d4f8

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2015 William Chen
+
+MIT License
+
+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/README.md

@@ -0,0 +1,57 @@
+# ruby-jgap
+
+A Ruby DSL for Genetic Algorithms using JGAP.
+
+The JGAP binary JAR file is packaged with this gem.
+
+JGAP is licensed under the GNU Lesser Public license; if you would like to use this gem in commercial applications, you can choose to use the Mozilla Public License and donate 50 euros to JGAP. [more details](http://jgap.sourceforge.net/#documentation)
+
+## Install
+
+    gem install ruby-jgap
+
+### Usage
+
+```ruby
+
+require 'java'
+require 'ruby-jgap'
+
+# subclass JGAP::Problem
+class MakeChangeProblem < JGAP::Problem
+
+  population_size 500
+
+  # define our solution chromosome
+  chromosome do
+    integer :quarters, min: 0, max: 3
+    integer :dimes, min: 0, max: 2
+    integer :nickels, min: 0, max: 1
+    integer :pennies, min: 0, max: 4
+  end
+
+  # define our fitness function
+  fitness_function do |subject|
+    target = 47 # goal: 47 cents
+    q = read subject, :quarters
+    d = read subject, :dimes
+    n = read subject, :nickels
+    p = read subject, :pennies
+    
+    coins = q + d + n + p
+    value = 25*q + 10*d + 5*n + p
+    delta = (target - value).abs # how far are we from our goal?
+    
+    fitness = (99 - delta)
+    fitness += 100 - (10*coins) if value == target # reward if matches with goal
+    return fitness
+  end
+
+
+end
+
+problem = MakeChangeProblem.new
+problem.run(100) # 100 generations
+problem.print_best
+
+```

data/lib/JGAP/problem.rb

@@ -0,0 +1,140 @@
+require 'java'
+require 'java/jgap.jar'
+
+java_import %w(
+  org.jgap.FitnessFunction
+  org.jgap.impl.DefaultConfiguration
+  org.jgap.impl.IntegerGene
+  org.jgap.impl.BooleanGene
+  org.jgap.impl.MapGene
+  org.jgap.impl.StringGene
+  org.jgap.impl.DoubleGene
+  org.jgap.Chromosome
+  org.jgap.Genotype
+)
+
+module JGAP
+  
+  class ChromosomeBuilder
+    
+    attr_reader :names
+    attr_reader :genes
+    
+    def initialize(config)
+      @config = config
+      @names = Hash.new
+      @genes = Array.new
+    end
+    
+    def chromosome
+      Chromosome.new(@config, @genes.to_java(Java::OrgJgap::Gene))
+    end
+    
+    def read(subject, name)
+      subject.gene(@names[name]).allele
+    end
+    
+    def integer(name, opts={})
+      @names[name] = @genes.length
+      if opts
+        @genes << IntegerGene.new(@config, opts[:min], opts[:max])
+      else
+        @genes << IntegerGene.new(@config)
+      end
+    end
+    
+    def decimal(name, opts={})
+      @names[name] = @genes.length
+      if opts
+        @genes << DoubleGene.new(@config, opts[:min], opts[:max])
+      else
+        @genes << DoubleGene.new(@config)
+      end
+    end
+    
+    def boolean(name)
+      @names[name] = @genes.length
+      @genes << BooleanGene.new(@config)
+    end
+    
+    def string(name, opts={})
+      @names[name] = @genes.length
+      if opts && opts[:alphabet]
+        @genes << StringGene.new(@config,
+          opts[:min], opts[:max], opts[:alphabet])
+      elsif opts
+        @genes << StringGene.new(@config, opts[:min], opts[:max])
+      else
+        @genes << StringGene.new(@config)
+      end
+    end
+    
+  end
+  
+  
+  ####
+  
+  class Problem < FitnessFunction
+    
+    attr_reader :best_solution
+    
+    def initialize
+      @config = DefaultConfiguration.new
+      @chromosome = nil
+      @population_size = 0
+      @population = nil
+      @best_solution = nil
+      @builder = ChromosomeBuilder.new(@config)
+    end
+  
+    
+    def setup
+      # Override me!
+    end
+    
+    def run(cycles=1)
+      chromosome
+      population_size
+      @config.set_fitness_function(self)
+      @config.set_sample_chromosome(@chromosome)
+      @config.set_population_size(@population_size)
+      @population = Genotype.random_initial_genotype(@config)
+      @population.evolve(cycles)
+      @best_solution = @population.get_fittest_chromosome
+    end
+    
+    def read(subject, name)
+      @builder.read(subject, name)
+    end
+    
+    def read_best(name)
+      read(best_solution, name)
+    end
+    
+    def print_best
+      @builder.names.each do |k, v|
+        puts "#{k}: #{read_best k}"
+      end
+    end
+    
+    ## MACROS
+    
+    def self.population_size(size)
+      define_method(:population_size) do
+        @population_size = size
+      end
+    end
+    
+    def self.chromosome(&block)
+      define_method(:chromosome) do
+        @builder.instance_eval(&block)
+        @chromosome = @builder.chromosome
+      end
+    end
+    
+    def self.fitness_function(&block)
+      define_method(:evaluate, &block)
+    end
+    
+  end
+end

data/lib/ruby-jgap.rb

@@ -0,0 +1,7 @@
+module JGAP
+  
+  require 'java'
+  require 'java/jgap.jar'
+  require_relative 'JGAP/problem'
+  
+end

data/ruby-jgap.gemspec

@@ -0,0 +1,18 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+
+Gem::Specification.new do |spec|
+  spec.name          = "ruby-jgap"
+  spec.version       = "0.0.1"
+  spec.platform      = "java"
+  spec.authors       = ["William Chen"]
+  spec.email         = ["wchen298@gmail.com"]
+  spec.summary       = %q{Ruby DSL for Genetic Algorithms using JGAP as a backend.} 
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+end

data/test.rb

@@ -0,0 +1,39 @@
+require 'java'
+require 'ruby-jgap'
+
+# subclass JGAP::Problem
+class MakeChangeProblem < JGAP::Problem
+
+  population_size 500
+
+  # define our solution chromosome
+  chromosome do
+    integer :quarters, min: 0, max: 3
+    integer :dimes, min: 0, max: 2
+    integer :nickels, min: 0, max: 1
+    integer :pennies, min: 0, max: 4
+  end
+
+  # define our fitness function
+  fitness_function do |subject|
+    target = 47 # goal: 47 cents
+    q = read subject, :quarters
+    d = read subject, :dimes
+    n = read subject, :nickels
+    p = read subject, :pennies
+    
+    coins = q + d + n + p
+    value = 25*q + 10*d + 5*n + p
+    delta = (target - value).abs # how far are we from our goal?
+    
+    fitness = (99 - delta)
+    fitness += 100 - (10*coins) if value == target # reward if matches with goal
+    return fitness
+  end
+
+
+end
+
+problem = MakeChangeProblem.new
+problem.run(100) # 100 generations
+problem.print_best

metadata

@@ -0,0 +1,53 @@
+--- !ruby/object:Gem::Specification
+name: ruby-jgap
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: java
+authors:
+- William Chen
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-02-09 00:00:00.000000000 Z
+dependencies: []
+description: 
+email:
+- wchen298@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".DS_Store"
+- LICENSE.txt
+- README.md
+- lib/.DS_Store
+- lib/JGAP/problem.rb
+- lib/java/jgap.jar
+- lib/ruby-jgap.rb
+- ruby-jgap.gemspec
+- test.rb
+homepage: 
+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.4.5
+signing_key: 
+specification_version: 4
+summary: Ruby DSL for Genetic Algorithms using JGAP as a backend.
+test_files: []