extremal_opt_tsp 0.0.1

checksums.yaml

@@ -0,0 +1,15 @@
+---
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    ZWU1MmQwOGNjM2NhMWEzOWRiMGRmYWM1OGM4YjkzYTUwNDU5OTZlZA==
+  data.tar.gz: !binary |-
+    OWNiZDNlOTU3YmFhMGMxZjI3NzFiZjRhZmVkYWQ3NDBlNTQ5MWUwYw==
+SHA512:
+  metadata.gz: !binary |-
+    ZDk4NzFhZGI1NGE4YWZiODM3ZGQyZDU0YjE5MTU3NDQ0MTQ0OTgyMGI1MTYy
+    ZGY5Y2Q0NGE3NzM2YmIyZGM4NDg1YzhhMzBjMDg5MDIyYmE2OGI3NmFkMjIz
+    ODc0MmNlMTgzZDZiOTNiMzAwMjM5YTIzYmRiNTJjYTU0YmJmZmM=
+  data.tar.gz: !binary |-
+    NzhlMWRmZWI2MmUyZTQzN2VlNTAwODJiMzMwOTEyNzQ0YTgyYmE5MTRkZTcw
+    NmNhZWRhZmZhMzU4MGRlZjZjNzljNjUzMjE1NDI4NjI0NjYwOGZiZmI2MDU0
+    YmZiMWZkYmFlMWE4NmRiMjNhNzVhYzA0NGY4ZjlhNDAyNGNjMjI=

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 extremal_opt_tsp.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,31 @@
+# ExtremalOptTsp
+
+  Extremal optimization to solve travelling salesman
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'extremal_opt_tsp'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install extremal_opt_tsp
+
+## Usage
+
+    ExtremalOptTsp::ExtremalOptTsp.new.search([[565,575],[25,185]], 250, 1.8)[:cost])
+    250 - max iterations
+    1.8 - t
+
+## 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/extremal_opt_tsp.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'extremal_opt_tsp/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "extremal_opt_tsp"
+  spec.version       = ExtremalOptTsp::VERSION
+  spec.authors       = ["no-glue"]
+  spec.email         = ["nikolapav1985@gmail.com"]
+  spec.description   = %q{extremal optimization to solve travelling salesman}
+  spec.summary       = %q{extremal optimization 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

data/lib/extremal_opt_tsp.rb

@@ -0,0 +1,156 @@
+require "extremal_opt_tsp/version"
+
+module ExtremalOptTsp
+  class ExtremalOptTsp
+    # distance, between two cities
+    def euc_2d(c1, c2)
+      Math.sqrt((c1[0] - c2[0]) ** 2.0 + (c1[1] - c2[1]) ** 2.0).round
+    end
+
+    # cost, of the tour
+    def cost(sh, cities)
+      distance = 0
+      sh.each_with_index do |c1, i|
+        c2 = (i == sh.size - 1) ? sh[0] : sh[i + 1]
+        distance += euc_2d(cities[c1], cities[c2])
+      end
+      distance
+    end
+
+    # shake, cities
+    def shake(cities)
+      sh = Array.new(cities.size){|i| i}
+      sh.each_index do |i|
+        r = rand(sh.size - i) + i
+        sh[r], sh[i] = sh[i], sh[r]
+      end
+      sh
+    end
+
+    # neighbors, get them ranked
+    def get_neighbor_rank(city_number, cities, ignore=[])
+      neighbors = []
+      cities.each_with_index do |city, i|
+        next if i == city_number or ignore.include?(i)
+        neighbor = {:number => i}
+        neighbor[:distance] = euc_2d(cities[city_number], city)
+        neighbors << neighbor
+      end
+      return neighbors.sort!{|x, y| x[:distance] <=> y[:distance]}
+    end
+
+    # edges, for city
+    def get_edges_for_city(city_number, sh)
+      c1, c2 = nil, nil
+      sh.each_with_index do |c, i|
+        if c == city_number
+          c1 = (i == 0) ? sh.last : sh[i - 1]
+          c2 = (i == sh.size - 1) ? sh.first : sh[i + 1]
+          break
+        end
+      end
+      return [c1, c2]
+    end
+
+    # fitness, city
+    def get_city_fitness(sh, city_number, cities)
+      c1, c2 = get_edges_for_city(city_number, sh)
+      neighbors = get_neighbor_rank(city_number, cities)
+      n1, n2 = -1, -1
+      neighbors.each_with_index do |neighbor, i|
+        n1 = i + 1 if neighbor[:number] == c1
+        n2 = i + 1 if neighbor[:number] == c2
+      end
+      return 3.0 / (n1.to_f + n2.to_f)
+    end
+
+    # fitnesses, cities
+    def get_city_fitnesses(cities, sh)
+      city_fitnesses = []
+      cities.each_with_index do |city, i|
+        city_fitness = {:number => i}
+        city_fitness[:fitness] = get_city_fitness(sh, i, cities)
+        city_fitnesses << city_fitness
+      end
+      return city_fitnesses.sort!{|x, y| x[:fitness] <=> y[:fitness]}
+    end
+
+    # probs, components
+    def get_component_probs(ordered_comps, t)
+      sum = 0.0
+      ordered_comps.each_with_index do |component, i|
+        component[:prob] = (i + 1.0) ** (-t)
+        sum += component[:prob]
+      end
+      sum
+    end
+
+    # select
+    def select(comps, sum_probs)
+      selection = rand()
+      comps.each_with_index do |comp, i|
+        selection -= (comp[:prob] / sum_probs)
+        return comp[:number] if selection <= 0.0
+      end
+      return comps.last[:number]
+    end
+
+    # select, city maybe
+    def select_maybe(ordered_comps, t, skip = [])
+      sum = get_component_probs(ordered_comps, t)
+      selected_city = nil
+      begin
+        selected_city = select(ordered_comps, sum)
+      end while skip.include?(selected_city)
+      selected_city
+    end
+
+    # shake, vary
+    def vary_shake(sh, selected, new, long_edge)
+      _sh = Array.new(sh)
+      c1, c2 = _sh.rindex(selected), _sh.rindex(selected)
+      p1, p2 = (c1 < c2) ? [c1, c2] : [c2, c1]
+      right = (c1 == _sh.size - 1) ? 0 : c1 + 1
+      if _sh[right] == long_edge
+        _sh[p1 + 1 ... p2] = _sh[p1 + 1 ... p2].reverse
+      else
+        _sh[p1 ... p2] = _sh[p1 ... p2].reverse
+      end
+      _sh
+    end
+
+    # longer edge, get
+    def get_longer_edge(edges, neighbor_distances)
+      n1 = neighbor_distances.find{|x| x[:number] = edges[0]}
+      n2 = neighbor_distances.find{|x| x[:number] = edges[1]}
+      return (n1[:distance] > n2[:distance]) ? n1[:number] : n2[:number]
+    end
+
+    # new shake
+    def new_shake(cities, t, sh)
+      city_fitnesses = get_city_fitnesses(cities, sh)
+      selected_city = select_maybe(city_fitnesses.reverse, t)
+      edges = get_edges_for_city(selected_city, sh)
+      neighbors = get_neighbor_rank(selected_city, cities)
+      new_neighbor = select_maybe(neighbors, t, edges)
+      long_edge = get_longer_edge(edges, neighbors)
+      return vary_shake(sh, selected_city, new_neighbor, long_edge)
+    end
+
+    # search
+    def search(cities, max_iterations, t)
+      current = {:vector => shake(cities)}
+      current[:cost] = cost(current[:vector], cities)
+      best = current
+      max_iterations.times do |iter|
+        candidate = {}
+        candidate[:vector] = new_shake(cities, t, current[:vector])
+        candidate[:cost] = cost(candidate[:vector], cities)
+        current = candidate
+        best = candidate if candidate[:cost] < best[:cost]
+        puts " > iter #{(iter + 1)}, best #{best[:cost]}"
+      end
+      best
+    end
+  end
+end

data/lib/extremal_opt_tsp/version.rb

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

data/spec/extremal_opt_tsp_spec.rb

@@ -0,0 +1,15 @@
+require 'spec_helper'
+
+describe ExtremalOptTsp do
+  it 'gets 7542 or greater for berlin' do
+    expect(ExtremalOptTsp::ExtremalOptTsp.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]], 250, 1.8)[:cost]).to be >= 7542
+  end
+end

data/spec/spec_helper.rb

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

metadata

@@ -0,0 +1,98 @@
+--- !ruby/object:Gem::Specification
+name: extremal_opt_tsp
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- no-glue
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-12-27 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: extremal optimization to solve travelling salesman
+email:
+- nikolapav1985@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- extremal_opt_tsp.gemspec
+- lib/extremal_opt_tsp.rb
+- lib/extremal_opt_tsp/version.rb
+- spec/extremal_opt_tsp_spec.rb
+- spec/spec_helper.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.1.11
+signing_key: 
+specification_version: 4
+summary: extremal optimization to solve travelling salesman
+test_files:
+- spec/extremal_opt_tsp_spec.rb
+- spec/spec_helper.rb