Algorithmically 0.1.2 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 7a20a235b28515eea9f3bc92defec55d22d6729d
-  data.tar.gz: 5d21f847f53c63d35c3418e2b0f66c84486494b1
+  metadata.gz: 923dab150a1c719d4578803afb1f2f00f0cefa9d
+  data.tar.gz: df4628866699eab63f79a99aa315dba1cc58d466
 SHA512:
-  metadata.gz: 875e6766cd3c27056098131cd6ddd7bf997a36df96ef8cbb6c5ce7bcb1f4327cfe3c91441d0e0f9cdfda4b6a4b88c17c9b1a45e063eeefc5589018ae446b93f1
-  data.tar.gz: 93adaaae0738b14f82936259b788c3b89d95875bd6745704f35ca640957f95da2919991c7e3c9bdb2e4356d9f123a70426b12b16da25f52264c1c0e24055a7f9
+  metadata.gz: 5cac3441e02e4de16906501f54904bee60c51259ba2dcff2c9dbbe14e48f52e2160a42b043b96aff8a9db53820fa4e71937db65a9fd8d043eb434c8ff9895a8e
+  data.tar.gz: 931ca10d22d3a4a4bbb6896a93337b0b9ac96d33ee4e3e38fbd825c360711733aebb82f2d52ac24aeb1cfec24b728ee2f0b3bb0df835852776ec5dd3ade3ddad

data/README.md

@@ -25,5 +25,9 @@ Or install it yourself as:
     Algorithmically::RandomSearch.new(2, 50)
 
     Algorithmically::AdaptiveRandomSearch.new(1000, 2, 0.05, 1.3, 3.0, 10, 30)
+    
+    Algorithmically::HillClimbing.new(2, 1000)
+    
+    Algorithmically::GuidedLocalSearch.new(150, [[565,575],[25,185],[345,750],[945,685]], 20, 0.3)
 
 

data/lib/Algorithmically.rb

@@ -1,6 +1,7 @@
 require 'Algorithmically/version'
 require 'Algorithmically/Stochastic/random_search'
 require 'Algorithmically/Stochastic/hill_climbing'
+require 'Algorithmically/Stochastic/guided_local_search'
 
 
 module Algorithmically

data/lib/Algorithmically/Stochastic/guided_local_search.rb

@@ -0,0 +1,107 @@
+module Stochastic
+
+  class GuidedLocalSearch
+
+    def initialize(max_iterations, berlin52, max_no_improv, lambda)
+      @berlin52 = berlin52
+      @max_iterations = max_iterations
+      @max_no_improv = max_no_improv
+      alpha = 0.3
+      local_search_optima = 12000.0
+      lambda = alpha * (local_search_optima/berlin52.size.to_f)
+      @lambda  = lambda
+      best = search(@max_iterations, @berlin52, @max_no_improv, lambda)
+      puts "Done. Best Solution: c=#{best[:cost]}, v=#{best[:vector].inspect}"
+    end
+
+    def euc_2d(c1, c2)
+      Math.sqrt((c1[0] - c2[0])**2.0 + (c1[1] - c2[1])**2.0).round
+    end
+
+    def random_permutation(cities)
+      perm = Array.new(cities.size) { |i| i }
+      perm.each_index do |i|
+        r = rand(perm.size-i) + i
+        perm[r], perm[i] = perm[i], perm[r]
+      end
+      perm
+    end
+
+    def stochastic_two_opt(permutation)
+      perm = Array.new(permutation)
+      c1, c2 = rand(perm.size), rand(perm.size)
+      exclude = [c1]
+      exclude << ((c1==0) ? perm.size-1 : c1-1)
+      exclude << ((c1==perm.size-1) ? 0 : c1+1)
+      c2 = rand(perm.size) while exclude.include?(c2)
+      c1, c2 = c2, c1 if c2 < c1
+      perm[c1...c2] = perm[c1...c2].reverse
+      perm
+    end
+
+    def augmented_cost(permutation, penalties, cities, lambda)
+      distance, augmented = 0, 0
+      permutation.each_with_index do |c1, i|
+        c2 = (i==permutation.size-1) ? permutation[0] : permutation[i+1]
+        c1, c2 = c2, c1 if c2 < c1
+        d = euc_2d(cities[c1], cities[c2])
+        distance += d
+        augmented += d + (lambda * (penalties[c1][c2]))
+      end
+      [distance, augmented]
+    end
+
+    def cost(cand, penalties, cities, lambda)
+      cost, acost = augmented_cost(cand[:vector], penalties, cities, lambda)
+      cand[:cost], cand[:aug_cost] = cost, acost
+    end
+
+    def local_search(current, cities, penalties, max_no_improv, lambda)
+      cost(current, penalties, cities, lambda)
+      count = 0
+      begin
+        candidate = {:vector => stochastic_two_opt(current[:vector])}
+        cost(candidate, penalties, cities, lambda)
+        count = (candidate[:aug_cost] < current[:aug_cost]) ? 0 : count+1
+        current = candidate if candidate[:aug_cost] < current[:aug_cost]
+      end until count >= max_no_improv
+      current
+    end
+
+    def calculate_feature_utilities(penal, cities, permutation)
+      utilities = Array.new(permutation.size, 0)
+      permutation.each_with_index do |c1, i|
+        c2 = (i==permutation.size-1) ? permutation[0] : permutation[i+1]
+        c1, c2 = c2, c1 if c2 < c1
+        utilities[i] = euc_2d(cities[c1], cities[c2]) / (1.0 + penal[c1][c2])
+      end
+      utilities
+    end
+
+    def update_penalties!(penalties, cities, permutation, utilities)
+      max = utilities.max()
+      permutation.each_with_index do |c1, i|
+        c2 = (i==permutation.size-1) ? permutation[0] : permutation[i+1]
+        c1, c2 = c2, c1 if c2 < c1
+        penalties[c1][c2] += 1 if utilities[i] == max
+      end
+      penalties
+    end
+
+    def search(max_iterations, cities, max_no_improv, lambda)
+      current = {:vector => random_permutation(cities)}
+      best = nil
+      penalties = Array.new(cities.size) { Array.new(cities.size, 0) }
+      max_iterations.times do |iter|
+        current=local_search(current, cities, penalties, max_no_improv, lambda)
+        utilities=calculate_feature_utilities(penalties, cities, current[:vector])
+        update_penalties!(penalties, cities, current[:vector], utilities)
+        best = current if best.nil? or current[:cost] < best[:cost]
+        puts " > iter=#{(iter+1)}, best=#{best[:cost]}, aug=#{best[:aug_cost]}"
+      end
+      best
+    end
+
+  end
+
+end

data/lib/Algorithmically/version.rb

@@ -1,3 +1,3 @@
 module Algorithmically
-  VERSION = '0.1.2'
+  VERSION = '0.1.3'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: Algorithmically
 version: !ruby/object:Gem::Version
-  version: 0.1.2
+  version: 0.1.3
 platform: ruby
 authors:
 - popac
@@ -77,6 +77,7 @@ files:
 - bin/setup
 - lib/Algorithmically.rb
 - lib/Algorithmically/Stochastic/adaptive_random_search.rb
+- lib/Algorithmically/Stochastic/guided_local_search.rb
 - lib/Algorithmically/Stochastic/hill_climbing.rb
 - lib/Algorithmically/Stochastic/random_search.rb
 - lib/Algorithmically/version.rb