metaheuristic_algorithms 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 1d0f703767effd3bf49ad6f0fdb937e81f4cca0b
+  data.tar.gz: 2b006e39389d9ab0cf870de9178150f956bd948e
+SHA512:
+  metadata.gz: 3128ccca278336b88d59a1dff1e91f6e087b038693ffc8a7da83a24c64e5afe42aa5a98a809586ccdb0460a35ddebea172254df017757eb7756cbf0ee6dda579
+  data.tar.gz: 3cc1be0fa3cb7093f7615fc4abfd0b182c0f906f9979d4025bf1370fbf9b290d70973fc6d13d70e1be4505d671782e2526e583d95dba5d8db488e20718727afe

data/.gitignore

@@ -0,0 +1,10 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+.DS_Store

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.ruby-gemset

@@ -0,0 +1 @@
+metaheuristic_algorithms

data/.ruby-version

@@ -0,0 +1 @@
+2.2.2

data/.travis.yml

@@ -0,0 +1,4 @@
+language: ruby
+rvm:
+  - 2.2.2
+before_install: gem install bundler -v 1.10.5

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,13 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, we pledge to respect all people who contribute through reporting issues, posting feature requests, updating documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free experience for everyone, regardless of level of experience, gender, gender identity and expression, sexual orientation, disability, personal appearance, body size, race, ethnicity, age, or religion.
+
+Examples of unacceptable behavior by participants include the use of sexual language or imagery, derogatory comments or personal attacks, trolling, public or private harassment, insults, or other unprofessional conduct.
+
+Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct. Project maintainers who do not follow the Code of Conduct may be removed from the project team.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by opening an issue or contacting one or more of the project maintainers.
+
+This Code of Conduct is adapted from the [Contributor Covenant](http://contributor-covenant.org), version 1.0.0, available at [http://contributor-covenant.org/version/1/0/0/](http://contributor-covenant.org/version/1/0/0/)

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in metaheuristic_algorithms.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Tadatoshi Takahashi
+
+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,39 @@
+# MetaheuristicAlgorithms
+
+Various metaheuristic algorithms implemented in Ruby.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'metaheuristic_algorithms'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install metaheuristic_algorithms
+
+## Usage
+
+See examples in RSpec codes under spec directory. 
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake rspec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/metaheuristic_algorithms. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "metaheuristic_algorithms"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,7 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/metaheuristic_algorithms/ant_colony_optimization.rb

@@ -0,0 +1,20 @@
+module MetaheuristicAlgorithms
+
+  class AntColonyOptimization
+    include MetaheuristicAlgorithms::Helper
+
+    def initialize(function_wrapper, number_of_variables: 1, objective: :maximization)
+      @function_wrapper = function_wrapper
+
+
+
+    end
+
+    def search
+
+
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/base_algorithm_module.rb

@@ -0,0 +1,12 @@
+module MetaheuristicAlgorithms
+
+  module BaseAlgorithmModule
+
+    def get_decision_variable_value_by_randomization(decision_variable_index)
+      @function_wrapper.miminum_decision_variable_values[decision_variable_index] 
+      + (@function_wrapper.maximum_decision_variable_values[decision_variable_index] - @function_wrapper.miminum_decision_variable_values[decision_variable_index]) * bigdecimal_rand
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/calculation_helper.rb

@@ -0,0 +1,47 @@
+module MetaheuristicAlgorithms
+
+  module CalculationHelper
+
+    def degree_to_radian(degree)
+      degree * BigDecimal(Math::PI.to_s) / BigDecimal('180')
+    end
+
+    def radian_to_degree(radian)
+      radian * BigDecimal('180') / BigDecimal(Math::PI.to_s)
+    end
+
+    def bigdecimal_exp(bigdecimal_value)
+      BigDecimal(Math.exp(bigdecimal_value.to_f).to_s)
+    end
+
+    def bigdecimal_cos(angle_in_radian)
+      BigDecimal(Math.cos(angle_in_radian.to_f).to_s)
+    end 
+
+    def bigdecimal_sin(angle_in_radian)
+      BigDecimal(Math.sin(angle_in_radian.to_f).to_s)
+    end
+
+    def bigdecimal_tan(angle_in_radian)
+      BigDecimal(Math.tan(angle_in_radian.to_f).to_s)
+    end
+    
+    def bigdecimal_asin(sin_value)
+      BigDecimal(Math.asin(sin_value.to_f).to_s)
+    end
+
+    def bigdecimal_acos(cos_value)
+      BigDecimal(Math.acos(cos_value.to_f).to_s)
+    end
+
+    def bigdecimal_atan2(y, x)
+      BigDecimal(Math.atan2(y.to_f, x.to_f).to_s)
+    end
+
+    def bigdecimal_sqrt(bigdecimal_value)
+      BigDecimal(Math.sqrt(bigdecimal_value.to_f).to_s)
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/firefly_algorithm.rb

@@ -0,0 +1,142 @@
+require 'bigdecimal'
+require 'bigdecimal/math'
+
+module MetaheuristicAlgorithms
+
+  class FireflyAlgorithm
+    include MetaheuristicAlgorithms::BaseAlgorithmModule
+    include MetaheuristicAlgorithms::Helper
+
+    # Note: May be able to use Struct for this purpose, moving update_light_intensity method to FireflyAlgorithm class.
+    class Firefly
+
+      attr_accessor :location_coordinates
+      attr_accessor :light_intensity
+
+      def initialize(function_wrapper, location_coordinates, light_intensity)
+        @function_wrapper = function_wrapper
+        @location_coordinates = location_coordinates
+        @light_intensity = light_intensity
+      end
+
+      def update_light_intensity
+        @light_intensity = @function_wrapper.objective_function_value(@location_coordinates)
+      end
+
+      def deep_clone
+        clone_object = self.clone
+        clone_object.location_coordinates = self.location_coordinates.clone
+        clone_object
+      end
+
+    end
+
+    def initialize(function_wrapper, number_of_variables: 1, objective: :maximization)
+      @function_wrapper = function_wrapper
+      @number_of_variables = number_of_variables
+      @objective_method_name = case objective
+                                 when :maximization
+                                   :max_by
+                                 when :minimization
+                                   :min_by
+                               end
+    end
+
+    def search(number_of_fireflies: 10, maximun_generation: 10, randomization_parameter_alpha: BigDecimal('0.2'), absorption_coefficient_gamma: BigDecimal('1.0'))
+
+      number_of_fireflies = number_of_fireflies.to_i unless number_of_fireflies.kind_of?(Integer)
+      maximun_generation = maximun_generation.to_i unless maximun_generation.kind_of?(Integer)
+      randomization_parameter_alpha = BigDecimal(randomization_parameter_alpha.to_s) unless randomization_parameter_alpha.kind_of?(BigDecimal)
+      absorption_coefficient_gamma = BigDecimal(absorption_coefficient_gamma.to_s) unless absorption_coefficient_gamma.kind_of?(BigDecimal)
+
+      initialize_fireflies(number_of_fireflies)
+
+      # 0 to maximun_generation-1
+      (0...maximun_generation).each do |generation|
+
+        @fireflies.each { |firefly| firefly.update_light_intensity }
+
+        move_fireflies(randomization_parameter_alpha, absorption_coefficient_gamma)
+
+      end
+
+      solution_firefly = @fireflies.send(@objective_method_name) { |firefly| firefly.light_intensity }
+
+      { best_decision_variable_values: solution_firefly.location_coordinates, best_objective_function_value: solution_firefly.light_intensity }
+
+    end
+
+    private
+      def initialize_fireflies(number_of_fireflies)
+
+        @fireflies = []
+
+        for i in (0...number_of_fireflies)
+          decision_variable_values = (0...@number_of_variables).map do |variable_index|
+            get_decision_variable_value_by_randomization(variable_index)
+          end
+
+          firefly = Firefly.new(@function_wrapper, decision_variable_values, BigDecimal('0'))
+          @fireflies << firefly
+        end
+
+      end
+
+      def move_fireflies(randomization_parameter_alpha, absorption_coefficient_gamma)
+
+        attractiveness_beta_at_distance_0 = BigDecimal('1')
+
+        fireflies_copy = @fireflies.map(&:deep_clone)
+
+        @fireflies.each do |firefly_i|
+
+          fireflies_copy.delete(firefly_i)
+
+          fireflies_copy.each do |firefly_j|
+
+            if firefly_i.light_intensity < firefly_j.light_intensity
+
+              distance_of_two_fireflies = distance_of_two_fireflies(firefly_i, firefly_j)
+
+              attractiveness_beta = attractiveness_beta_at_distance_0 * BigMath.exp(-absorption_coefficient_gamma * distance_of_two_fireflies.power(2), 10)
+
+              (0...@number_of_variables).each do |variable_index|
+                new_location_coordinate = firefly_i.location_coordinates[variable_index] * (BigDecimal('1') - attractiveness_beta) 
+                                          + firefly_j.location_coordinates[variable_index] * attractiveness_beta 
+                                          + randomization_parameter_alpha * (bigdecimal_rand - BigDecimal('0.5'))
+                new_location_coordinate = constrain_within_range(new_location_coordinate, variable_index)
+
+                firefly_i.location_coordinates[variable_index] = new_location_coordinate
+              end
+
+            end
+
+          end
+
+        end
+
+      end
+
+      def constrain_within_range(location_coordinate, variable_index)
+        if location_coordinate < @function_wrapper.miminum_decision_variable_values[variable_index]
+          @function_wrapper.miminum_decision_variable_values[variable_index]
+        elsif location_coordinate > @function_wrapper.maximum_decision_variable_values[variable_index]
+          @function_wrapper.maximum_decision_variable_values[variable_index]
+        else
+          location_coordinate
+        end
+      end
+
+      def distance_of_two_fireflies(firefly_1, firefly_2)
+
+        sum_of_squares = (0...@number_of_variables).inject(BigDecimal('0')) do |sum, variable_index|
+          sum + (firefly_1.location_coordinates[variable_index] - firefly_2.location_coordinates[variable_index]).power(2)
+        end
+
+        sum_of_squares.sqrt(10)
+
+      end       
+
+  end
+
+end

data/lib/metaheuristic_algorithms/function_wrappers/abstract_wrapper.rb

@@ -0,0 +1,32 @@
+module MetaheuristicAlgorithms
+
+  module FunctionWrappers
+    
+    class AbstractWrapper
+
+      # Return value: Array
+      def maximum_decision_variable_values
+        raise "#{__method__} method must be implemented in the subclass"
+      end
+
+      # Return value: Array
+      def miminum_decision_variable_values
+        raise "#{__method__} method must be implemented in the subclass"
+      end    
+
+      # Input value: Array
+      def objective_function_value(decision_variable_values)
+        raise "#{__method__} method must be implemented in the subclass"
+      end
+
+      # For the algorithm that requires initial estimate that is depending on the particular objective function:
+      # Return value: Array
+      def initial_decision_variable_value_estimates
+        raise "#{__method__} method must be implemented in the subclass"
+      end
+
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/function_wrappers/easom_function_wrapper.rb

@@ -0,0 +1,30 @@
+require 'bigdecimal/math'
+
+module MetaheuristicAlgorithms
+
+  module FunctionWrappers
+    
+    class EasomFunctionWrapper < AbstractWrapper
+      include MetaheuristicAlgorithms::CalculationHelper
+
+      def maximum_decision_variable_values
+        [BigDecimal('10')]
+      end
+
+      def miminum_decision_variable_values
+        [BigDecimal('-10')]
+      end
+
+      def objective_function_value(decision_variable_values)
+        -bigdecimal_cos(decision_variable_values[0]) * BigMath.exp((-(decision_variable_values[0] - BigMath.PI(10)).power(2)), 10)
+      end
+
+      def initial_decision_variable_value_estimates
+        raise "#{__method__} method must be implemented in the subclass"
+      end
+
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/function_wrappers/michaelwicz_function_wrapper.rb

@@ -0,0 +1,31 @@
+require 'bigdecimal/math'
+
+module MetaheuristicAlgorithms
+
+  module FunctionWrappers
+    
+    class MichaelwiczFunctionWrapper < AbstractWrapper
+      include MetaheuristicAlgorithms::CalculationHelper
+
+      def maximum_decision_variable_values
+        [BigDecimal('4'), BigDecimal('4')]
+      end
+
+      def miminum_decision_variable_values
+        [BigDecimal('0'), BigDecimal('0')]
+      end
+
+      def objective_function_value(decision_variable_values)
+        -bigdecimal_sin(decision_variable_values[0]) * bigdecimal_sin(decision_variable_values[0].power(2) / BigMath.PI(10)).power(20) - 
+        bigdecimal_sin(decision_variable_values[1]) * bigdecimal_sin(decision_variable_values[1].power(2) / BigMath.PI(10)).power(20)
+      end
+
+      def initial_decision_variable_value_estimates
+        raise "#{__method__} method must be implemented in the subclass"
+      end
+
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/function_wrappers/nonsmooth_multipeak_function_wrapper.rb

@@ -0,0 +1,29 @@
+require 'bigdecimal/math'
+
+module MetaheuristicAlgorithms
+
+  module FunctionWrappers
+    
+    class NonsmoothMultipeakFunctionWrapper < AbstractWrapper
+
+      def maximum_decision_variable_values
+        [BigDecimal('5'), BigDecimal('5')]
+      end
+
+      def miminum_decision_variable_values
+        [BigDecimal('-5'), BigDecimal('-5')]
+      end
+
+      def objective_function_value(decision_variable_values)
+        (decision_variable_values[0].abs + decision_variable_values[1].abs) * BigMath.exp((BigDecimal('-0.0625') * (decision_variable_values[0].power(2) + decision_variable_values[1].power(2))), 10)     
+      end
+
+      def initial_decision_variable_value_estimates
+        raise "#{__method__} method must be implemented in the subclass"
+      end
+
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/function_wrappers/rosenbrook_function_wrapper.rb

@@ -0,0 +1,27 @@
+module MetaheuristicAlgorithms
+
+  module FunctionWrappers
+    
+    class RosenbrookFunctionWrapper < AbstractWrapper
+
+      def maximum_decision_variable_values
+        [BigDecimal('5'), BigDecimal('5')]
+      end
+
+      def miminum_decision_variable_values
+        [BigDecimal('-5'), BigDecimal('-5')]
+      end
+
+      def objective_function_value(decision_variable_values)
+        (BigDecimal('1') - decision_variable_values[0]).power(2) + BigDecimal('100') * (decision_variable_values[1] - decision_variable_values[0].power(2)).power(2)
+      end
+
+      def initial_decision_variable_value_estimates
+        [BigDecimal('2'), BigDecimal('2')]
+      end
+
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/function_wrappers.rb

@@ -0,0 +1,13 @@
+require "metaheuristic_algorithms/function_wrappers/abstract_wrapper"
+require "metaheuristic_algorithms/function_wrappers/rosenbrook_function_wrapper"
+require "metaheuristic_algorithms/function_wrappers/nonsmooth_multipeak_function_wrapper"
+require "metaheuristic_algorithms/function_wrappers/easom_function_wrapper"
+require "metaheuristic_algorithms/function_wrappers/michaelwicz_function_wrapper"
+
+module MetaheuristicAlgorithms
+
+  module FunctionWrappers
+    
+  end
+
+end

data/lib/metaheuristic_algorithms/genetic_algorithm.rb

@@ -0,0 +1,200 @@
+module MetaheuristicAlgorithms
+
+  class GeneticAlgorithm
+    include MetaheuristicAlgorithms::BaseAlgorithmModule
+    include MetaheuristicAlgorithms::Helper
+
+    def initialize(function_wrapper, number_of_variables: 1, objective: :maximization)
+      @function_wrapper = function_wrapper
+      @number_of_variables = number_of_variables
+      @objective_method_name = case objective
+                                 when :maximization
+                                   :max
+                                 when :minimization
+                                   :min
+                               end        
+
+      ## Decided to use decimal number representation and convert it to binary number by unpack method
+      ## because it is difficult to initialize variable within the given range
+      # @string_length_in_bits = 16
+    end
+
+    def search(population_size: 20, maximum_number_of_generations: 100, number_of_mutation_sites: BigDecimal('2'), crossover_probability: BigDecimal('0.95'), mutation_probability: BigDecimal('0.05'))
+
+      population_size = population_size.to_i unless population_size.kind_of?(Integer)
+      maximum_number_of_generations = maximum_number_of_generations.to_i unless maximum_number_of_generations.kind_of?(Integer)
+      number_of_mutation_sites = BigDecimal(number_of_mutation_sites.to_s) unless number_of_mutation_sites.kind_of?(BigDecimal)
+      crossover_probability = BigDecimal(crossover_probability.to_s) unless crossover_probability.kind_of?(BigDecimal)
+      mutation_probability = BigDecimal(mutation_probability.to_s) unless mutation_probability.kind_of?(BigDecimal)
+
+      initialize_population(population_size)
+
+      (0...maximum_number_of_generations).each do |generation_index|
+
+        @population_copy = deep_clone_population
+
+        (0...population_size).each do |individual_index|
+
+          if bigdecimal_rand < crossover_probability
+
+            # Crossover pair:
+            crossover_pair_1_index = generate_random_index(population_size)
+            crossover_pair_2_index = generate_random_index(population_size)     
+
+            crossover(crossover_pair_1_index, crossover_pair_2_index)
+
+          end
+
+          if bigdecimal_rand < mutation_probability
+
+            mutation_individual_index = generate_random_index(population_size)
+
+            mutate(mutation_individual_index, number_of_mutation_sites)
+
+          end
+
+        end
+
+      end
+
+      objective_function_value = @population_fitness.send(@objective_method_name)
+      decision_variable_values = @population[@population_fitness.index(objective_function_value)]
+
+      { best_decision_variable_values: decision_variable_values, best_objective_function_value: objective_function_value }
+
+    end
+
+    private
+
+      def initialize_population(population_size)
+
+        @population = []
+        @population_fitness = []
+
+        # 0 to population_size-1
+        (0...population_size).each do |individual_index|
+          decision_variable_values = (0...@number_of_variables).map do |variable_index|
+            get_decision_variable_value_by_randomization(variable_index)
+          end
+          @population << decision_variable_values
+          @population_fitness << @function_wrapper.objective_function_value(decision_variable_values)
+        end
+
+      end
+
+      def generate_random_index(population_size)
+        (population_size * rand).floor
+      end
+
+      def crossover(crossover_pair_1_index, crossover_pair_2_index)
+
+        crossover_pair_1_decimal_values = []
+        crossover_pair_2_decimal_values = []
+
+        (0...@number_of_variables).each do |variable_index|
+
+          crossover_pair_1_decimal_value = @population_copy[crossover_pair_1_index][variable_index]
+          crossover_pair_2_decimal_value = @population_copy[crossover_pair_2_index][variable_index]
+
+          crossover_pair_1_binary_32_string = decimal_to_binary_32_string(crossover_pair_1_decimal_value)
+          crossover_pair_2_binary_32_string = decimal_to_binary_32_string(crossover_pair_2_decimal_value)
+
+          # 32 bits string with the first bit as sign bit. Hence, the length is 32 - 1:
+          crossover_point = 31 * rand
+
+          crossover_pair_1_binary_32_string_after_crossover = crossover_pair_1_binary_32_string[0, crossover_point] + 
+                                                              crossover_pair_2_binary_32_string[crossover_point+1, 32]
+          crossover_pair_2_binary_32_string_after_crossover = crossover_pair_2_binary_32_string[0, crossover_point] + 
+                                                              crossover_pair_1_binary_32_string[crossover_point+1, 32] 
+
+          crossover_pair_1_decimal_value_after_crossover = binary_32_string_to_decimal(crossover_pair_1_binary_32_string_after_crossover)
+          crossover_pair_2_decimal_value_after_crossover = binary_32_string_to_decimal(crossover_pair_2_binary_32_string_after_crossover)
+
+          if in_the_range?(crossover_pair_1_decimal_value_after_crossover, variable_index) &&
+             in_the_range?(crossover_pair_2_decimal_value_after_crossover, variable_index)
+            crossover_pair_1_decimal_values << crossover_pair_1_decimal_value_after_crossover
+            crossover_pair_2_decimal_values << crossover_pair_2_decimal_value_after_crossover
+          else
+            crossover_pair_1_decimal_values << crossover_pair_1_decimal_value
+            crossover_pair_2_decimal_values << crossover_pair_2_decimal_value
+          end
+
+        end 
+
+        new_crossover_pair_1_fitness = @function_wrapper.objective_function_value(crossover_pair_1_decimal_values)
+        new_crossover_pair_2_fitness = @function_wrapper.objective_function_value(crossover_pair_2_decimal_values)
+
+        if new_crossover_pair_1_fitness > @population_fitness[crossover_pair_1_index] && 
+           new_crossover_pair_2_fitness > @population_fitness[crossover_pair_2_index]
+
+          @population[crossover_pair_1_index] = @population_copy[crossover_pair_1_index] = crossover_pair_1_decimal_values 
+          @population[crossover_pair_2_index] = @population_copy[crossover_pair_2_index] = crossover_pair_2_decimal_values 
+
+          @population_fitness[crossover_pair_1_index] = new_crossover_pair_1_fitness
+          @population_fitness[crossover_pair_2_index] = new_crossover_pair_2_fitness
+
+        end                                       
+
+      end
+
+      def decimal_to_binary_32_string(decimal_number)
+        [decimal_number].pack('g').bytes.map{|n| "%08b" % n}.join
+      end
+
+      def binary_32_string_to_decimal(binary_32_string)
+        decimal_float_value = [binary_32_string].pack("B*").unpack('g')[0].round(4)
+        BigDecimal(decimal_float_value.to_s)
+      end
+
+      def mutate(individual_index, number_of_mutation_sites)
+
+        decimal_values = (0...@number_of_variables).map do |variable_index|
+
+          decimal_value = @population_copy[individual_index][variable_index]
+          binary_32_string = decimal_to_binary_32_string(decimal_value)
+
+          mutated_binary_32_string = binary_32_string.clone
+
+          (0...number_of_mutation_sites).each do |i|
+            mutation_site_index = generate_mutation_site_index
+            # Flips 1 to 0 or 0 to 1:
+            mutated_binary_32_string[mutation_site_index] = ((binary_32_string[mutation_site_index].to_i + 1).modulo(2)).to_s
+          end
+
+          decimal_value_after_mutation = binary_32_string_to_decimal(mutated_binary_32_string)
+
+          if in_the_range?(decimal_value_after_mutation, variable_index)
+            decimal_value_after_mutation
+          else
+            decimal_value
+          end
+
+        end
+
+        new_individual_fitness = @function_wrapper.objective_function_value(decimal_values)
+
+        if new_individual_fitness > @population_fitness[individual_index]          
+
+          @population[individual_index] = @population_copy[individual_index] = decimal_values
+
+          @population_fitness[individual_index] = new_individual_fitness
+
+        end          
+
+      end
+
+      def generate_mutation_site_index
+        (31 * rand).floor
+      end
+
+      def in_the_range?(decimal_value, variable_index)
+        decimal_value >= @function_wrapper.miminum_decision_variable_values[variable_index] && decimal_value <= @function_wrapper.maximum_decision_variable_values[variable_index]
+      end 
+
+      def deep_clone_population
+        @population.map { |individual| individual.clone }
+      end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/harmony_search.rb

@@ -0,0 +1,103 @@
+module MetaheuristicAlgorithms
+
+  class HarmonySearch
+    include MetaheuristicAlgorithms::BaseAlgorithmModule
+    include MetaheuristicAlgorithms::Helper
+
+    # objective: :maximization or :minimization
+    def initialize(function_wrapper, number_of_variables: 1, objective: :maximization)
+      @function_wrapper = function_wrapper
+      @number_of_variables = number_of_variables
+      @objective_method_name = case objective
+                                 when :maximization
+                                   :max
+                                 when :minimization
+                                   :min
+                               end
+      @objective_comparison_operator = case objective
+                               when :maximization
+                                 :>
+                               when :minimization
+                                 :<
+                             end 
+
+      @decision_variable_range = [@function_wrapper.miminum_decision_variable_values, @function_wrapper.maximum_decision_variable_values]   
+    end
+
+    def search(maximum_attempt: 2500, pitch_adjusting_range: BigDecimal('100'), harmony_search_size: 20, harmony_memory_acceping_rate: BigDecimal('0.95'), pitch_adjusting_rate: BigDecimal('0.7'))
+
+      maximum_attempt = maximum_attempt.to_i unless maximum_attempt.kind_of?(Integer)
+      pitch_adjusting_range = BigDecimal(pitch_adjusting_range.to_s) unless pitch_adjusting_range.kind_of?(BigDecimal)
+      harmony_search_size = harmony_search_size.to_i unless harmony_search_size.kind_of?(Integer)
+      harmony_memory_acceping_rate = BigDecimal(harmony_memory_acceping_rate.to_s) unless harmony_memory_acceping_rate.kind_of?(BigDecimal)
+      pitch_adjusting_rate = BigDecimal(pitch_adjusting_rate.to_s) unless pitch_adjusting_rate.kind_of?(BigDecimal)
+
+      initialize_harmony_memory(harmony_search_size)
+
+      # 0 to maximum_attempt-1
+      (0...maximum_attempt).each do |count|
+
+        decision_variable_values = (0...@number_of_variables).map do |variable_index|
+
+          if rand > harmony_memory_acceping_rate
+            decision_variable_value = get_decision_variable_value_by_randomization(variable_index)
+          else
+            # Since the array index starts with 0 unlike MatLab, 1 is not added as in the code example in MatLab:
+            harmony_memory_random_index = (harmony_search_size * bigdecimal_rand).fix
+            decision_variable_value = @harmony_memory[harmony_memory_random_index][variable_index]
+            
+            if bigdecimal_rand < pitch_adjusting_rate
+              pitch_adjusting = (@function_wrapper.maximum_decision_variable_values[variable_index] - @function_wrapper.miminum_decision_variable_values[variable_index]) / pitch_adjusting_range
+              decision_variable_value = decision_variable_value + pitch_adjusting * (bigdecimal_rand - BigDecimal('0.5'))
+            end
+          end
+
+          decision_variable_value
+
+        end
+
+        best_function_value = @function_wrapper.objective_function_value(decision_variable_values) 
+
+        # TODO: Evaluate this logic. It appears that best_function_value_harmony_memory only needs to store the max best_function_value and the corresponding harmony_memory_random_index of harmony_memory. 
+        #       The simpler implementation for MatLab doesn't seem to be a good implementation in Ruby here. 
+        #       Or MatLab code can use Object-Oriented class as a value object (There is Object-Oriented construct in MatLab).  
+        # When objective = :maximization, "if best_function_value > @best_function_value_harmony_memory.max"
+        # When objective = :minimization, "if best_function_value < @best_function_value_harmony_memory.min"
+        if best_function_value.send(@objective_comparison_operator, @best_function_value_harmony_memory.send(@objective_method_name))
+          # If harmony_memory_random_index is not set in the if statement above, it means a new search and use the index for the max best function value: 
+          harmony_memory_random_index ||= @best_function_value_harmony_memory.index(@best_function_value_harmony_memory.send(@objective_method_name))
+          @harmony_memory[harmony_memory_random_index] = decision_variable_values
+          @best_function_value_harmony_memory[harmony_memory_random_index] = best_function_value
+        end
+
+      end
+
+      objective_function_value = @best_function_value_harmony_memory.send(@objective_method_name)
+      decision_variable_values = @harmony_memory[@best_function_value_harmony_memory.index(objective_function_value)]
+
+      { best_decision_variable_values: decision_variable_values, best_objective_function_value: objective_function_value }
+
+    end
+
+    private
+      def initialize_harmony_memory(harmony_search_size)
+
+        @harmony_memory = []
+        @best_function_value_harmony_memory = []
+
+        for i in (0...harmony_search_size)
+
+          decision_variable_values = (0...@number_of_variables).map do |variable_index|
+            get_decision_variable_value_by_randomization(variable_index)
+          end
+
+          @harmony_memory << decision_variable_values
+          @best_function_value_harmony_memory << @function_wrapper.objective_function_value(decision_variable_values)
+
+        end
+
+      end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/helper.rb

@@ -0,0 +1,11 @@
+module MetaheuristicAlgorithms
+
+  module Helper
+
+    def bigdecimal_rand
+      BigDecimal("#{rand.to_s}")
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/simplified_particle_swarm_optimization.rb

@@ -0,0 +1,87 @@
+module MetaheuristicAlgorithms
+
+  class SimplifiedParticleSwarmOptimization
+    include MetaheuristicAlgorithms::BaseAlgorithmModule
+    include MetaheuristicAlgorithms::Helper
+
+    def initialize(function_wrapper, number_of_variables: 1, objective: :maximization)
+      @function_wrapper = function_wrapper
+      @number_of_variables = number_of_variables
+      @objective_method_name = case objective
+                                 when :maximization
+                                   :max
+                                 when :minimization
+                                   :min
+                               end        
+    end
+
+    def search(number_of_particiles: 20, number_of_iterations: 15, social_coefficient: BigDecimal('0.5'), random_variable_coefficient: BigDecimal('0.2'))
+
+      number_of_particiles = number_of_particiles.to_i unless number_of_particiles.kind_of?(Integer)
+      number_of_iterations = number_of_iterations.to_i unless number_of_iterations.kind_of?(Integer)
+      social_coefficient = BigDecimal(social_coefficient.to_s) unless social_coefficient.kind_of?(BigDecimal)
+      random_variable_coefficient = BigDecimal(random_variable_coefficient.to_s) unless random_variable_coefficient.kind_of?(BigDecimal)        
+
+      initialize_particles(number_of_particiles)
+
+      global_best_position = nil
+      best_function_value = nil
+
+      # 0 to number_of_iterations-1
+      (0...number_of_iterations).each do |iteration|
+
+        function_values = @particle_locations.map do |particle_location|
+          @function_wrapper.objective_function_value(particle_location)
+        end 
+
+        best_function_value = function_values.send(@objective_method_name)
+        global_best_position = @particle_locations[function_values.index(best_function_value)]
+
+        move_particles(global_best_position, social_coefficient, random_variable_coefficient)
+
+      end
+
+      { best_decision_variable_values: global_best_position, best_objective_function_value: best_function_value }
+
+    end
+
+    private
+      def initialize_particles(number_of_particiles)
+
+        @particle_locations = []
+
+        # 0 to number_of_particiles-1
+        (0...number_of_particiles).each do |individual_index|
+          decision_variable_values = (0...@number_of_variables).map do |variable_index|
+            get_decision_variable_value_by_randomization(variable_index)
+          end
+          @particle_locations << decision_variable_values
+        end
+
+      end
+
+      def move_particles(global_best_position, social_coefficient, random_variable_coefficient)
+       
+        # 0 to @particle_locations-1
+        @particle_locations = @particle_locations.map do |particle_location|
+
+          (0...@number_of_variables).map do |variable_index|
+
+            # The value out-of-range in order to enter while loop
+            new_particle_location_coordinate = @function_wrapper.miminum_decision_variable_values[variable_index] - BigDecimal('1')
+
+            while new_particle_location_coordinate < @function_wrapper.miminum_decision_variable_values[variable_index] || new_particle_location_coordinate > @function_wrapper.maximum_decision_variable_values[variable_index]
+              new_particle_location_coordinate = (BigDecimal('1') - social_coefficient) * particle_location[variable_index] + social_coefficient * global_best_position[variable_index] + random_variable_coefficient * (bigdecimal_rand - BigDecimal('0.5'))
+            end
+
+            new_particle_location_coordinate
+
+          end
+
+        end          
+
+      end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/simulated_annealing.rb

@@ -0,0 +1,117 @@
+require 'bigdecimal/math'
+require 'distribution'
+
+module MetaheuristicAlgorithms
+
+  class SimulatedAnnealing
+    include MetaheuristicAlgorithms::Helper
+
+    def initialize(function_wrapper, number_of_variables: 1, objective: :maximization)
+      @function_wrapper = function_wrapper
+      @number_of_variables = number_of_variables
+      @objective_comparison_operator = case objective
+                               when :maximization
+                                 :>
+                               when :minimization
+                                 :<
+                             end        
+    end
+
+    def search(temperature: BigDecimal('100.0'), minimal_temperature: BigDecimal('1'), maximum_number_of_rejections: 2500, 
+               maximum_number_of_runs: 500, maximum_number_of_acceptances: 15, 
+               bolzmann_constant: BigDecimal('1'), cooling_factor: BigDecimal('0.95'), energy_norm: BigDecimal('10'), 
+               standard_diviation_for_estimation: BigDecimal('6'), ratio_of_energy_delta_over_evaluation_delta: BigDecimal('10'))
+
+      temperature = BigDecimal(temperature.to_s) unless temperature.kind_of?(BigDecimal)
+      minimal_temperature = BigDecimal(minimal_temperature.to_s) unless minimal_temperature.kind_of?(BigDecimal)
+      maximum_number_of_rejections = maximum_number_of_rejections.to_i unless maximum_number_of_rejections.kind_of?(Integer)
+      maximum_number_of_runs = maximum_number_of_runs.to_i unless maximum_number_of_runs.kind_of?(Integer)
+      maximum_number_of_acceptances = maximum_number_of_acceptances.to_i unless maximum_number_of_acceptances.kind_of?(Integer)
+      bolzmann_constant = BigDecimal(bolzmann_constant.to_s) unless bolzmann_constant.kind_of?(BigDecimal)
+      cooling_factor = BigDecimal(cooling_factor.to_s) unless cooling_factor.kind_of?(BigDecimal)
+      energy_norm = BigDecimal(energy_norm.to_s) unless energy_norm.kind_of?(BigDecimal)
+      standard_diviation_for_estimation = BigDecimal(standard_diviation_for_estimation.to_s) unless standard_diviation_for_estimation.kind_of?(BigDecimal)
+      ratio_of_energy_delta_over_evaluation_delta = BigDecimal(ratio_of_energy_delta_over_evaluation_delta.to_s) unless ratio_of_energy_delta_over_evaluation_delta.kind_of?(BigDecimal)
+
+      number_of_runs = 0
+      number_of_rejections = 0
+      number_of_acceptances = 0
+      total_evaluations = 0
+
+      initial_estimates = @function_wrapper.initial_decision_variable_value_estimates
+
+      best_evaluation = @function_wrapper.objective_function_value(initial_estimates)
+
+      best_solution = initial_estimates      
+
+      # TODO: Add the code to check with minimal_function_value if looking for the minimal value: 
+      while temperature > minimal_temperature && number_of_rejections <= maximum_number_of_rejections
+
+        number_of_runs = number_of_runs + 1
+
+        if number_of_runs >= maximum_number_of_runs || number_of_acceptances > maximum_number_of_acceptances
+
+          temperature = cooling_factor * temperature
+          total_evaluations = total_evaluations + 1
+          number_of_runs = 1
+          number_of_acceptances = 1
+
+        end
+
+        new_estimates = estimate_solution(initial_estimates, standard_diviation_for_estimation)
+        new_evaluation = @function_wrapper.objective_function_value(new_estimates)
+
+        evaluation_delta = ratio_of_energy_delta_over_evaluation_delta * (new_evaluation - best_evaluation)
+
+        # Accept if improved:
+        # When objective = :maximization, "if evaluation_delta > 0 && evaluation_delta > energy_norm"
+        # When objective = :minimization, "if evaluation_delta < 0 && -evaluation_delta > energy_norm"
+        if evaluation_delta.send(@objective_comparison_operator, BigDecimal('0')) && evaluation_delta.abs > energy_norm
+          best_solution = new_estimates
+          best_evaluation = new_evaluation
+          number_of_acceptances = number_of_acceptances + 1
+          number_of_rejections = 0
+        # Accept with a small probability if not improved
+        elsif acceptance_probability(evaluation_delta, temperature, bolzmann_constant) > bigdecimal_rand
+          best_solution = new_estimates
+          best_evaluation = new_evaluation
+          number_of_acceptances = number_of_acceptances + 1            
+        else
+          number_of_rejections = number_of_rejections + 1
+        end
+
+      end
+
+      { best_decision_variable_values: best_solution, best_objective_function_value: best_evaluation }
+
+    end
+
+    private
+      def estimate_solution(previous_estimates, standard_diviation_for_estimation)
+
+        (0...@number_of_variables).map do |variable_index|
+
+          # The value out-of-range in order to enter while loop
+          new_estimate = @function_wrapper.miminum_decision_variable_values[variable_index] - BigDecimal('1')
+
+          while new_estimate < @function_wrapper.miminum_decision_variable_values[variable_index] || new_estimate > @function_wrapper.maximum_decision_variable_values[variable_index]
+
+            # MatLab example code uses newGuess = initialGuess + rand(1,2) * randn;
+            # But in our case, the value range is different. 
+            new_estimate = BigDecimal(Distribution::Normal.rng(previous_estimates[variable_index], standard_diviation_for_estimation).call.to_s)
+
+          end
+
+          new_estimate
+
+        end
+
+      end
+
+      def acceptance_probability(evaluation_delta, temperature, bolzmann_constant)
+        BigMath.exp((-evaluation_delta / (bolzmann_constant * temperature)), 10)
+      end
+
+  end
+
+end

data/lib/metaheuristic_algorithms/version.rb

@@ -0,0 +1,3 @@
+module MetaheuristicAlgorithms
+  VERSION = "0.1.0"
+end

data/lib/metaheuristic_algorithms/virtual_bee_algorithm.rb

@@ -0,0 +1,27 @@
+require 'bigdecimal'
+
+module MetaheuristicAlgorithms
+
+  class VirtualBeeAlgorithm
+    include MetaheuristicAlgorithms::Helper
+
+    def initialize(function_wrapper, number_of_variables: 1, objective: :maximization)
+      @function_wrapper = function_wrapper
+
+
+    end
+
+    def search(number_of_virtual_bees: 20, number_of_foraging_explorations: 600)
+
+      number_of_virtual_bees = number_of_virtual_bees.to_i unless number_of_virtual_bees.kind_of?(Integer)
+      number_of_foraging_explorations = number_of_foraging_explorations.to_i unless number_of_foraging_explorations.kind_of?(Integer)
+
+      solution_estimates = @function_wrapper.initial_decision_variable_value_estimates
+
+
+
+    end
+
+  end
+
+end

data/lib/metaheuristic_algorithms.rb

@@ -0,0 +1,17 @@
+require 'metaheuristic_algorithms/version'
+require 'bigdecimal'
+require 'metaheuristic_algorithms/calculation_helper'
+require 'metaheuristic_algorithms/function_wrappers'
+require 'metaheuristic_algorithms/base_algorithm_module'
+require 'metaheuristic_algorithms/helper'
+require 'metaheuristic_algorithms/harmony_search'
+require 'metaheuristic_algorithms/firefly_algorithm'
+require 'metaheuristic_algorithms/genetic_algorithm'
+require 'metaheuristic_algorithms/simulated_annealing'
+require 'metaheuristic_algorithms/simplified_particle_swarm_optimization'
+require 'metaheuristic_algorithms/ant_colony_optimization'
+require 'metaheuristic_algorithms/virtual_bee_algorithm'
+
+module MetaheuristicAlgorithms
+  # Your code goes here...
+end

data/metaheuristic_algorithms.gemspec

@@ -0,0 +1,36 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'metaheuristic_algorithms/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "metaheuristic_algorithms"
+  spec.version       = MetaheuristicAlgorithms::VERSION
+  spec.authors       = ["Tadatoshi Takahashi"]
+  spec.email         = ["tadatoshi@gmail.com"]
+
+  spec.summary       = %q{Various metaheuristic algorithms implemented in Ruby.}
+  spec.description   = %q{Various metaheuristic algorithms implemented in Ruby.}
+  spec.homepage      = "https://github.com/tadatoshi/metaheuristic_algorithms"
+  spec.license       = "MIT"
+
+  # Prevent pushing this gem to RubyGems.org by setting 'allowed_push_host', or
+  # delete this section to allow pushing this gem to any host.
+  if spec.respond_to?(:metadata)
+    spec.metadata['allowed_push_host'] = "https://rubygems.org"
+  else
+    raise "RubyGems 2.0 or newer is required to protect against public gem pushes."
+  end
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_dependency "distribution"  
+
+  spec.add_development_dependency "bundler", "~> 1.10"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec"
+  spec.add_development_dependency "pry-byebug"  
+end

metadata

@@ -0,0 +1,146 @@
+--- !ruby/object:Gem::Specification
+name: metaheuristic_algorithms
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Tadatoshi Takahashi
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2015-08-08 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: distribution
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry-byebug
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Various metaheuristic algorithms implemented in Ruby.
+email:
+- tadatoshi@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".ruby-gemset"
+- ".ruby-version"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/metaheuristic_algorithms.rb
+- lib/metaheuristic_algorithms/ant_colony_optimization.rb
+- lib/metaheuristic_algorithms/base_algorithm_module.rb
+- lib/metaheuristic_algorithms/calculation_helper.rb
+- lib/metaheuristic_algorithms/firefly_algorithm.rb
+- lib/metaheuristic_algorithms/function_wrappers.rb
+- lib/metaheuristic_algorithms/function_wrappers/abstract_wrapper.rb
+- lib/metaheuristic_algorithms/function_wrappers/easom_function_wrapper.rb
+- lib/metaheuristic_algorithms/function_wrappers/michaelwicz_function_wrapper.rb
+- lib/metaheuristic_algorithms/function_wrappers/nonsmooth_multipeak_function_wrapper.rb
+- lib/metaheuristic_algorithms/function_wrappers/rosenbrook_function_wrapper.rb
+- lib/metaheuristic_algorithms/genetic_algorithm.rb
+- lib/metaheuristic_algorithms/harmony_search.rb
+- lib/metaheuristic_algorithms/helper.rb
+- lib/metaheuristic_algorithms/simplified_particle_swarm_optimization.rb
+- lib/metaheuristic_algorithms/simulated_annealing.rb
+- lib/metaheuristic_algorithms/version.rb
+- lib/metaheuristic_algorithms/virtual_bee_algorithm.rb
+- metaheuristic_algorithms.gemspec
+homepage: https://github.com/tadatoshi/metaheuristic_algorithms
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+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.7
+signing_key: 
+specification_version: 4
+summary: Various metaheuristic algorithms implemented in Ruby.
+test_files: []