taboo_reactive_search 0.0.1

checksums.yaml

@@ -0,0 +1,15 @@
+---
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    ZGFkNzBhMjI1NzhmYzkwYTc5YTkzOTI4OWM1ODU3NjI4OTUzZWY1OA==
+  data.tar.gz: !binary |-
+    ZjkwYjUyZmFhN2FiNzc3MzE5ZTg3MGNkMjk0MjViY2Q3Nzc3ZmY3Ng==
+SHA512:
+  metadata.gz: !binary |-
+    NjZmYjc0YjYwYTA4MDAxOGFiZDA1YzQ0ODgzMWQ3YmY5MGY5M2I3Y2Q5ZTll
+    YzE5Zjg1YjgyNmExNmU1MGUyZjM1YzdmYmMwYjlmZTU5NDliYTEzZjAyZjEx
+    Nzg3ODZhYjdlYmYxNzVjNDc1MDg5NWFhYWEyYWFjMGZhZWZjYWI=
+  data.tar.gz: !binary |-
+    NWY4NDY2YTgzZWEyZjNmZDk1OGMxNTRkMDRjNGVjNTUyNzI1NjYyZWQxMWEw
+    ZDhlY2U3ZjhjNjk1OTg2ZmQ5ZDNhOTVjMzA1OWFhNDgzODMxNTliNjgxYjM1
+    YTY2YzY5Zjk4M2U2NmE1MmM1NjViYTNiYzQ5MzhmNjI4YmZiN2E=

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 dusan
+
+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,29 @@
+# TabooReactiveSearch
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'taboo_reactive_search'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install taboo_reactive_search
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

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

data/lib/taboo_reactive_search/version.rb

@@ -0,0 +1,3 @@
+module TabooReactiveSearch
+  VERSION = "0.0.1"
+end

data/lib/taboo_reactive_search.rb

@@ -0,0 +1,176 @@
+require "taboo_reactive_search/version"
+
+module TabooReactiveSearch
+  class TabooReactiveSearch
+    # get distance between cities
+    def euc_2d(c1, c2)
+      Math.sqrt((c2[0] - c1[0]) ** 2.0 + (c2[1] - c1[1]) ** 2.0).round
+    end
+
+    # cost
+    def cost(shake, cities)
+      distance = 0
+      shake.each_with_index do |c1, i|
+        c2 = (i == (shake.size - 1)) ? shake[0] : shake[i + 1]
+        # +++ get distance between two cities
+        distance += euc_2d cities[c1], cities[c2]
+      end
+      distance
+    end
+
+    # shake
+    def shake(cities)
+      shake = Array.new(cities.size){|i| i}
+      shake.each_index do |i|
+        r = rand(shake.size - 1) + 1
+        shake[i], shake[r] = shake[r], shake[i]
+      end
+      shake
+    end
+
+    # reverse in range
+    def two_opt(shake)
+      perm = Array.new(shake)
+      c1, c2 = rand(perm.size), rand(perm.size)
+      collection = [c1]
+      collection << ((c1 == 0 ? perm.size - 1 : c1 - 1))
+      collection << ((c1 == perm.size - 1) ? 0 : c1 + 1)
+      c2 = rand(perm.size) while collection.include? (c2)
+      c1, c2 = c2, c1 if c2 < c1
+      # +++ reverses in range
+      perm[c1...c2] = perm[c1...c2].reverse
+      return perm, [[shake[c1 - 1], shake[c1]], [shake[c2 - 1], shake[c2]]]
+    end
+
+    # is taboo
+    def is_taboo?(edge, taboo_list, iter, prohib_period)
+      taboo_list.each do |entry|
+        if entry[:edge] = edge
+          return true if entry[:iter] >= iter - prohib_period
+          return false
+        end
+      end
+      false
+    end
+
+    # make taboo
+    def make_taboo(taboo_list, edge, iter)
+      taboo_list.each do |entry|
+        if entry[:edge] == edge
+          entry[:iter] = iter
+          return entry
+        end
+      end
+      entry = {:edge => edge, :iter => iter}
+      taboo_list.push(entry)
+      entry
+    end
+
+    # to edge list
+    def to_edge_list(shake)
+      list = []
+      shake.each_with_index do |c1, i|
+        c2 = (i == (shake.size - 1)) ? shake[0] : shake[i + 1]
+        c1, c2 = c2, c1 if c2 < c1
+        list << [c1, c2]
+      end
+      list
+    end
+
+    # same
+    def equivalent(el1, el2)
+      el1.each {|e| return false if el2.nil? || !el2.include?(e)}
+      true
+    end
+
+    # get candidate
+    def get_candidate(best, cities)
+      candidate = {}
+      candidate[:vector], edges = two_opt(best[:vector])
+      candidate[:cost] = cost(candidate[:vector], cities)
+      return candidate, edges
+    end
+
+    # get entry
+    def get_candidate_entry(visited_list, shake)
+      edge_list = to_edge_list(shake)
+      visited_list.each do |entry|
+        return entry if equivalent(edge_list, entry[:edge_list])
+      end
+      nil
+    end
+
+    # store shake
+    def store_shake(visited_list, shake, iteration)
+      entry = {}
+      entry[:entry_list] = to_edge_list(shake)
+      entry[:iter] = iteration
+      entry[:visits] = 1
+      visited_list.push(entry)
+      entry
+    end
+
+    # sort hood
+    def sort_neighborhood(candidates, taboo_list, prohib_period, iteration)
+      taboo, admissable = [], []
+      candidates.each do |a|
+        if is_taboo?(a[1][0], taboo_list, iteration, prohib_period) or
+          is_taboo?(a[1][1], taboo_list, iteration, prohib_period)
+          taboo << a
+        else
+          admissable << a
+        end
+      end
+      return [taboo, admissable]
+    end
+
+    # search
+    def search(cities, max_cand, max_iter, increase, decrease)
+      # setup
+      current = {:vector => shake(cities)}
+      current[:cost] = cost(current[:vector], cities)
+      best = current
+      taboo_list, prohib_period = [], 1
+      visited_list, avg_size, last_change = [], 1, 0
+      max_iter.times do |iter|
+        candidate_entry = get_candidate_entry(visited_list, current[:vector])
+        if !candidate_entry.nil?
+          repetition_interval = iter - candidate_entry[:iter]
+          candidate_entry[:iter] = iter
+          candidate_entry[:visits] += 1
+          if repetition_interval < 2 * (cities.size - 1)
+            avg_size = 0.1 * (iter - candidate_entry[:iter]) + 0.9 * avg_size
+            prohib_period = (prohib_period.to_f * increase)
+            last_change = iter
+          end
+        else
+          store_shake(visited_list, current[:vector], iter)
+        end
+        if iter - last_change > avg_size
+          prohib_period = [prohib_period * decrease, 1].max
+          last_change = iter
+        end
+        candidates = Array.new(max_cand) do |i|
+          get_candidate(current, cities)
+        end
+        candidates.sort!{|x, y| x.first[:cost] <=> y.first[:cost] }
+        taboo, admis = sort_neighborhood(candidates, taboo_list, prohib_period, iter)
+        if admis.size < 2
+          prohib_period = cities.size - 2
+          last_change = iter
+        end
+        current, best_move_edges = (admis.empty?) ? taboo.first : admis.first
+        if !taboo.empty?
+          tf = taboo.first[0]
+          if tf[:cost] < best[:cost] and tf[:cost] < current[:cost]
+            current, best_move_edges = taboo.first
+          end
+        end
+        best_move_edges.each{|edge| make_taboo(taboo_list, edge, iter)}
+        best = candidates.first[0] if candidates.first[0][:cost] < best[:cost]
+        puts " > iter #{(iter + 1)}, best #{best[:cost]}"
+      end
+      best
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,6 @@
+require 'rubygems'
+require 'bundler/setup'
+require 'taboo_reactive_search'
+
+RSpec.configure do |config|
+end

data/spec/taboo_reactive_search_spec.rb

@@ -0,0 +1,15 @@
+require 'spec_helper'
+
+describe TabooReactiveSearch do
+  it 'gets 7542 or greater for berlin' do
+    expect(TabooReactiveSearch::TabooReactiveSearch.new.search([[565,575],[25,185],[345,750],[945,685],[845,655],
+   [880,660],[25,230],[525,1000],[580,1175],[650,1130],[1605,620],
+   [1220,580],[1465,200],[1530,5],[845,680],[725,370],[145,665],
+   [415,635],[510,875],[560,365],[300,465],[520,585],[480,415],
+   [835,625],[975,580],[1215,245],[1320,315],[1250,400],[660,180],
+   [410,250],[420,555],[575,665],[1150,1160],[700,580],[685,595],
+   [685,610],[770,610],[795,645],[720,635],[760,650],[475,960],
+   [95,260],[875,920],[700,500],[555,815],[830,485],[1170,65],
+   [830,610],[605,625],[595,360],[1340,725],[1740,245]], 50, 100, 1.3, 0.9)[:cost]).to be >= 7542
+  end
+end

data/taboo_reactive_search.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'taboo_reactive_search/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "taboo_reactive_search"
+  spec.version       = TabooReactiveSearch::VERSION
+  spec.authors       = ["no-glue"]
+  spec.email         = ["nikolapav1985@gmail.com"]
+  spec.description   = %q{taboo reactive search to solve travelling salesman}
+  spec.summary       = %q{taboo reactive search to solve travelling salesman}
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  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"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake"
+  spec.add_development_dependency "rspec"
+end

metadata

@@ -0,0 +1,98 @@
+--- !ruby/object:Gem::Specification
+name: taboo_reactive_search
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- no-glue
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-12-23 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  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: 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'
+description: taboo reactive search to solve travelling salesman
+email:
+- nikolapav1985@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/taboo_reactive_search.rb
+- lib/taboo_reactive_search/version.rb
+- spec/spec_helper.rb
+- spec/taboo_reactive_search_spec.rb
+- taboo_reactive_search.gemspec
+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.1.11
+signing_key: 
+specification_version: 4
+summary: taboo reactive search to solve travelling salesman
+test_files:
+- spec/spec_helper.rb
+- spec/taboo_reactive_search_spec.rb