annealer 0.1

checksums.yaml

@@ -0,0 +1,15 @@
+---
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    OGE3NzQyNDk2MmM5NGRmNWY0NTdkZTg2OGRmYmFmNzZkMjM1OTNiOQ==
+  data.tar.gz: !binary |-
+    ZWVhNzgxNGRmZWViNTE1NTU0ZThhNTVmODQyZGUwNjMxZDMwMWUxZg==
+!binary "U0hBNTEy":
+  metadata.gz: !binary |-
+    NWNmYTJkZWI3OGNkMDA3ZGY5Njg0Mjg2OTA0ZGYyMGFmYzAyYTBjM2VhYTVj
+    NTBhOGZhNGVjMzI3OTY0NmIyNmJhMGNlYWI2MjM4NGY5NzBkYzAyZmZhNjg0
+    MGU2OTEzYWE3NTRkODE5YmVkN2JjNzAwNmMzNTM2ZDZkZjMzNGE=
+  data.tar.gz: !binary |-
+    MmI3Mjk2MWMwNDVkYTA0MDgyMTgzOGU3NzY2M2FmMjJjMjIzYjI3MmRmZGRh
+    OTkwN2VmYmRiZDNiMjMxOTQ2ZDIxMTIyZmQ5N2ZjMjc4ZDUzZjIzNjc3NmYy
+    ZDg4YjZmYjc1NjljYzRlODdiNDNkZTc2MzJkMTc3YmQ2MTcxMzY=

data/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2013 Paul Cantrell
+
+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 @@
+Anneal before the might of Sutekh!

data/lib/annealer.rb

@@ -0,0 +1,80 @@
+class Annealer
+  def initialize(opts = {})
+    max_iter = (opts[:max_iter] || 1000)
+    
+    @cooling_func = opts[:cooling_func] || lambda do |iter_count|
+      Math.exp(iter_count / (opts[:cooling_time] || max_iter * 1000))
+    end
+  
+    @transition_probability = opts[:transition_probability] || lambda do |e0, e1, temp|
+      Math.exp((e0 - e1) / temp)
+    end
+  
+    @stop_condition = opts[:stop_condition] || lambda do |iter_count, best_energy|
+      iter_count > max_iter
+    end
+    
+    @repetition_count = opts[:repetition_count] || 1
+    
+    @logger = opts[:logger] || Class.new do
+      def initialize(log_to)
+        @log_to = log_to
+      end
+      
+      def info(msg)
+        @log_to.puts(msg) if @log_to
+      end
+    end.new(opts[:log_to])
+    
+    @log_progress_frequency = opts[:log_progress_frequency] || 5000
+  end
+  
+  attr_accessor :logger
+  
+  # Given a (probably random) starting state, returns a state that approximately minimizes
+  # an arbitrary "energy" metric.
+  #
+  # The given start_state must implement two methods:
+  #
+  #  - *energy*: Returns the metric you want to optimize.
+  #  - *random_neighbor*:
+  #      Returns a randomly selected new state which differs slightly from this one.
+  #      This method _must not modify_ the original state, but instead return a clean copy.
+  #      You must ensure that the entire state space you want to search is reachable by hopping
+  #      from neighbor to neighbor. Ideally, the new state should be likely to have similar energy
+  #      (i.e. "neighbors" should be small changes); at the same time, you don't want it to require
+  #      too many hops between any two states.
+  #
+  def anneal(start_state)
+    best_state = nil
+    best_energy = 1 / 0.0
+    energy = start_state.energy
+    
+    @repetition_count.times do |rep|
+      logger.info "Repetition #{rep}..." if @repetition_count > 1
+      state = best_state || start_state
+      
+      iter_count = 0
+      while !@stop_condition.call(iter_count, best_energy)
+        temperature = @cooling_func.call(iter_count)
+        new_state = state.random_neighbor
+        new_energy = new_state.energy
+        logger.info "Iteration #{iter_count} (energy = #{new_energy})..." if iter_count % @log_progress_frequency == 0
+    
+        if best_state.nil? || @transition_probability.call(energy, new_energy, temperature) > rand
+          state, energy = new_state, new_energy
+          if new_energy < best_energy
+            best_state, best_energy = state, energy
+            logger.info "New best solution on rep #{rep}, iter #{iter_count} with energy #{energy}:"
+            logger.info state.inspect
+          end
+        end
+    
+        iter_count += 1
+      end
+    end
+    
+    best_state
+  end
+  
+end

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: annealer
+version: !ruby/object:Gem::Version
+  version: '0.1'
+platform: ruby
+authors:
+- Paul Cantrell
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-10-16 00:00:00.000000000 Z
+dependencies: []
+description: 
+email: cantrell@pobox.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/annealer.rb
+- README.md
+- LICENSE
+homepage: http://github.com/pcantrell/annealer
+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.7
+signing_key: 
+specification_version: 4
+summary: Simulated annealing framework
+test_files: []