greedy_ra_algorithm 0.0.1

checksums.yaml

@@ -0,0 +1,15 @@
+---
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    ODUyMmM4ZTU1N2U5NmVkYzJjZDdhY2YxMzBkMzNhNjVkN2MwMTQ4Zg==
+  data.tar.gz: !binary |-
+    MGE1OWVlNTRmOGFiNDVkNzQwMmZjMDE1ZjdhMjZiMjAzZDc4ODQ1Ng==
+SHA512:
+  metadata.gz: !binary |-
+    MDlhMDA0ZDUxNjI2MjA2NDNmZjIzYjQzZjhhMDYwNzRkMjRkYTgyZDY3MWE5
+    MmE0YzE4NjQ2NDJmNTlmYzQ3ZmFiZDA0ZGQ3NmNiZmZlNjE5NmQ1Njg2OGZh
+    MDIxYmQzOWIzZTNmN2JjNzZhMWVlYzdmOTY1M2I4ZTA5NWZlNGU=
+  data.tar.gz: !binary |-
+    NmE2YzljOGU5MDhjNTZmODI5MzU4MGY1NDE1MTBlZjc4N2JkMjhkM2JhN2Nl
+    MzEwYzA5ZTJmMmE5YjExOWI3M2EyNzlhNTY3MzViOWIwMzI1MGRhNzY1Yzc2
+    MGE4ODA3MWY4NmI3NzI1YzI4MWE0ZTRlODk0NjlhNzFlODI4MWE=

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 greedy_ra_algorithm.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 @@
+# GreedyRaAlgorithm
+
+Greedy randomized adaptive algorithm to solve travelling salesman.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'greedy_ra_algorithm'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install greedy_ra_algorithm
+
+## 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/greedy_ra_algorithm.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'greedy_ra_algorithm/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "greedy_ra_algorithm"
+  spec.version       = GreedyRaAlgorithm::VERSION
+  spec.authors       = ["dusan"]
+  spec.email         = ["dusan.milanovic@gecko.rs"]
+  spec.description   = %q{greedy randomized adapitve algorithm to solve travelling salesman}
+  spec.summary       = %q{greedy randomized adaptive algorithms 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/greedy_ra_algorithm/version.rb

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

data/lib/greedy_ra_algorithm.rb

@@ -0,0 +1,79 @@
+require "greedy_ra_algorithm/version"
+
+module GreedyRaAlgorithm
+  class GreedyRaAlgorithm
+    # gets distance between cities
+    def euc_2d(c1, c2)
+      Math.sqrt((c2[0] - c1[0]) ** 2.0 + (c2[1] - c1[1]) ** 2.0).round
+    end
+
+    # gets distance between two cities
+    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
+
+    # gets 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
+      perm
+    end
+
+    # does two opt
+    def local_search(best, cities, max_no_improv)
+      count = 0
+      begin
+        candidate = {:vector => two_opt(best[:vector])}
+        candidate[:cost] = cost(candidate[:vector], cities)
+        count = (candidate[:cost] < best[:cost]) ? 0 : count + 1
+        best = candidate if candidate[:cost] < best[:cost]
+      end until count >= max_no_improv
+      best
+    end
+
+    #get solution
+    def randomized_greedy_solution(cities, greedy)
+      candidate = {}
+      candidate[:vector] = [rand(cities.size)]
+      allCities = Array.new(cities.size){|i| i}
+      while candidate[:vector].size < cities.size
+        candidates = allCities - candidate[:vector]
+        costs = Array.new(candidates.size) do |i|
+          euc_2d(cities[candidate[:vector].last], cities[i])
+        end
+        rcl, max, min = [], costs.max, costs.min
+        costs.each_with_index do |cost, i|
+          rcl << candidates[i] if cost <= (min + greedy * (max - min))
+        end
+        candidate[:vector] << rcl[rand(rcl.size)]
+      end
+      candidate[:cost] = cost(candidate[:vector], cities)
+      candidate
+    end
+
+    # search
+    def search(cities, max_iter, max_no_improv, greedy)
+      best = nil
+      max_iter.times do |iter|
+        candidate = randomized_greedy_solution(cities, greedy)
+        candidate = local_search(candidate, cities, max_no_improv)
+        best = candidate if best.nil? or candidate[:cost] < best[:cost]
+        puts " > iteration #{(iter + 1)}, best #{best[:cost]}"
+      end
+      best
+    end
+  end
+end

data/spec/greedy_ra_algorithm_spec.rb

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

data/spec/spec_helper.rb

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

metadata

@@ -0,0 +1,98 @@
+--- !ruby/object:Gem::Specification
+name: greedy_ra_algorithm
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- dusan
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-12-19 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: greedy randomized adapitve algorithm to solve travelling salesman
+email:
+- dusan.milanovic@gecko.rs
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- greedy_ra_algorithm.gemspec
+- lib/greedy_ra_algorithm.rb
+- lib/greedy_ra_algorithm/version.rb
+- spec/greedy_ra_algorithm_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: greedy randomized adaptive algorithms to solve travelling salesman
+test_files:
+- spec/greedy_ra_algorithm_spec.rb
+- spec/spec_helper.rb