taboo_search 0.0.1
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +15 -0
- data/.gitignore +17 -0
- data/Gemfile +4 -0
- data/LICENSE.txt +22 -0
- data/README.md +33 -0
- data/Rakefile +6 -0
- data/lib/taboo_search.rb +91 -0
- data/lib/taboo_search/version.rb +3 -0
- data/spec/spec_helper.rb +6 -0
- data/spec/taboo_search_spec.rb +15 -0
- data/taboo_search.gemspec +24 -0
- metadata +98 -0
checksums.yaml
ADDED
@@ -0,0 +1,15 @@
|
|
1
|
+
---
|
2
|
+
!binary "U0hBMQ==":
|
3
|
+
metadata.gz: !binary |-
|
4
|
+
MTNhYWFjZjY1NmI1MDFjNzE0YzkzNTFlNzEzODc5OGVlNDIyNjkwMA==
|
5
|
+
data.tar.gz: !binary |-
|
6
|
+
OTQ5NWQ1OTgxODc4ODRlODU1ODE1OTg4M2I0YjdkM2FmMDdhODA2MA==
|
7
|
+
SHA512:
|
8
|
+
metadata.gz: !binary |-
|
9
|
+
Yzk1NGQ2ZjE4YzcyNGY4N2JjMmVkYzdiYTBhYzQ1MTk5ZGVkMmM2OTIwYWZl
|
10
|
+
Mjg5OGVmM2E3ZjlhM2JmODQ5NGQ0YTAxOTZiOGQ3NTk2YTYxNjBiZTk4YzZl
|
11
|
+
ZmNkNWUzY2QwZWNiMTRkMmUwYmY0ZjM5MWM3MDhhMjViZTQwYzU=
|
12
|
+
data.tar.gz: !binary |-
|
13
|
+
YzZiN2MzMGUxMmUzNzc5ZDQ0OGM4OTlhMzIzNTc4YWE4YzRiNzY5NWQxZTYx
|
14
|
+
MmFhZDRlNDM2ZWUwYzljZmNiODBlNTQwNzcyOGJlNDliNDU1MzM3Y2FjNzJl
|
15
|
+
MmNiZGZhZTdkMGY5M2VjYjczMTFhY2VlMTI5YjU2NDEzYTc2NjU=
|
data/.gitignore
ADDED
data/Gemfile
ADDED
data/LICENSE.txt
ADDED
@@ -0,0 +1,22 @@
|
|
1
|
+
Copyright (c) 2013 dusan
|
2
|
+
|
3
|
+
MIT License
|
4
|
+
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining
|
6
|
+
a copy of this software and associated documentation files (the
|
7
|
+
"Software"), to deal in the Software without restriction, including
|
8
|
+
without limitation the rights to use, copy, modify, merge, publish,
|
9
|
+
distribute, sublicense, and/or sell copies of the Software, and to
|
10
|
+
permit persons to whom the Software is furnished to do so, subject to
|
11
|
+
the following conditions:
|
12
|
+
|
13
|
+
The above copyright notice and this permission notice shall be
|
14
|
+
included in all copies or substantial portions of the Software.
|
15
|
+
|
16
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
17
|
+
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
18
|
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
19
|
+
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
20
|
+
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
21
|
+
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
22
|
+
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
data/README.md
ADDED
@@ -0,0 +1,33 @@
|
|
1
|
+
# TabooSearch
|
2
|
+
|
3
|
+
Taboo search to solve travelling salesman.
|
4
|
+
|
5
|
+
## Installation
|
6
|
+
|
7
|
+
Add this line to your application's Gemfile:
|
8
|
+
|
9
|
+
gem 'taboo_search'
|
10
|
+
|
11
|
+
And then execute:
|
12
|
+
|
13
|
+
$ bundle
|
14
|
+
|
15
|
+
Or install it yourself as:
|
16
|
+
|
17
|
+
$ gem install taboo_search
|
18
|
+
|
19
|
+
## Usage
|
20
|
+
|
21
|
+
TabooSearch::TabooSearch.new.search([[50, 50], [70, 70]], 15, 50, 100)
|
22
|
+
|
23
|
+
15 - taboo list size
|
24
|
+
50 - max candidates
|
25
|
+
100 - max iterations
|
26
|
+
|
27
|
+
## Contributing
|
28
|
+
|
29
|
+
1. Fork it
|
30
|
+
2. Create your feature branch (`git checkout -b my-new-feature`)
|
31
|
+
3. Commit your changes (`git commit -am 'Add some feature'`)
|
32
|
+
4. Push to the branch (`git push origin my-new-feature`)
|
33
|
+
5. Create new Pull Request
|
data/Rakefile
ADDED
data/lib/taboo_search.rb
ADDED
@@ -0,0 +1,91 @@
|
|
1
|
+
require "taboo_search/version"
|
2
|
+
|
3
|
+
module TabooSearch
|
4
|
+
class TabooSearch
|
5
|
+
# gets distance between cities
|
6
|
+
def euc_2d(c1, c2)
|
7
|
+
Math.sqrt((c2[0] - c1[0]) ** 2.0 + (c2[1] - c1[1]) ** 2.0).round
|
8
|
+
end
|
9
|
+
|
10
|
+
# gets distance between two cities
|
11
|
+
def cost(shake, cities)
|
12
|
+
distance = 0
|
13
|
+
shake.each_with_index do |c1, i|
|
14
|
+
c2 = (i == (shake.size - 1)) ? shake[0] : shake[i + 1]
|
15
|
+
# +++ get distance between two cities
|
16
|
+
distance += euc_2d cities[c1], cities[c2]
|
17
|
+
end
|
18
|
+
distance
|
19
|
+
end
|
20
|
+
|
21
|
+
# shake
|
22
|
+
def shake(cities)
|
23
|
+
shake = Array.new(cities.size){|i| i}
|
24
|
+
shake.each_index do |i|
|
25
|
+
r = rand(shake.size - 1) + 1
|
26
|
+
shake[i], shake[r] = shake[r], shake[i]
|
27
|
+
end
|
28
|
+
shake
|
29
|
+
end
|
30
|
+
|
31
|
+
# gets reverse in range
|
32
|
+
def two_opt(shake)
|
33
|
+
perm = Array.new(shake)
|
34
|
+
c1, c2 = rand(perm.size), rand(perm.size)
|
35
|
+
collection = [c1]
|
36
|
+
collection << ((c1 == 0 ? perm.size - 1 : c1 - 1))
|
37
|
+
collection << ((c1 == perm.size - 1) ? 0 : c1 + 1)
|
38
|
+
c2 = rand(perm.size) while collection.include? (c2)
|
39
|
+
c1, c2 = c2, c1 if c2 < c1
|
40
|
+
# +++ reverses in range
|
41
|
+
perm[c1...c2] = perm[c1...c2].reverse
|
42
|
+
return perm, [[shake[c1 - 1], shake[c1]], [shake[c2 - 1], shake[c2]]]
|
43
|
+
end
|
44
|
+
|
45
|
+
# is taboo
|
46
|
+
def is_taboo?(shake, taboo_list)
|
47
|
+
shake.each_with_index do |c1, i|
|
48
|
+
c2 = (i == (shake.size - 1)) ? shake[0] : shake[i + 1]
|
49
|
+
taboo_list.each do |forbidden_edge|
|
50
|
+
return true if forbidden_edge == [c1, c2]
|
51
|
+
end
|
52
|
+
end
|
53
|
+
false
|
54
|
+
end
|
55
|
+
|
56
|
+
# candidate
|
57
|
+
def candidate(best, taboo_list, cities)
|
58
|
+
shake, edges = nil, nil
|
59
|
+
begin
|
60
|
+
shake, edges = two_opt(best[:vector])
|
61
|
+
end while is_taboo?(shake, taboo_list)
|
62
|
+
candidate = {:vector => shake}
|
63
|
+
candidate[:cost] = cost(candidate[:vector], cities)
|
64
|
+
return candidate, edges
|
65
|
+
end
|
66
|
+
|
67
|
+
# search
|
68
|
+
def search(cities, taboo_list_size, candidate_list_size, max_iter)
|
69
|
+
current = {:vector => shake(cities)}
|
70
|
+
current[:cost] = cost(current[:vector], cities)
|
71
|
+
best = current
|
72
|
+
taboo_list = Array.new(taboo_list_size)
|
73
|
+
max_iter.times do |iter|
|
74
|
+
candidates = Array.new(candidate_list_size) do |i|
|
75
|
+
candidate(current, taboo_list, cities)
|
76
|
+
end
|
77
|
+
candidates.sort!{|x, y| x.first[:cost] <=> y.first[:cost]}
|
78
|
+
best_candidate = candidates.first[0]
|
79
|
+
best_candidate_edges = candidates.first[1]
|
80
|
+
if best_candidate[:cost] < current[:cost]
|
81
|
+
current = best_candidate
|
82
|
+
best = best_candidate if best_candidate[:cost] < best[:cost]
|
83
|
+
best_candidate_edges.each{|edge| taboo_list.push(edge)}
|
84
|
+
taboo_list.pop while taboo_list.size > taboo_list_size
|
85
|
+
end
|
86
|
+
puts " > iteration #{(iter + 1)}, best #{best[:cost]}"
|
87
|
+
end
|
88
|
+
best
|
89
|
+
end
|
90
|
+
end
|
91
|
+
end
|
data/spec/spec_helper.rb
ADDED
@@ -0,0 +1,15 @@
|
|
1
|
+
require 'spec_helper'
|
2
|
+
|
3
|
+
describe TabooSearch do
|
4
|
+
it 'gets 7542 or greater for berlin' do
|
5
|
+
expect(TabooSearch::TabooSearch.new.search([[565,575],[25,185],[345,750],[945,685],[845,655],
|
6
|
+
[880,660],[25,230],[525,1000],[580,1175],[650,1130],[1605,620],
|
7
|
+
[1220,580],[1465,200],[1530,5],[845,680],[725,370],[145,665],
|
8
|
+
[415,635],[510,875],[560,365],[300,465],[520,585],[480,415],
|
9
|
+
[835,625],[975,580],[1215,245],[1320,315],[1250,400],[660,180],
|
10
|
+
[410,250],[420,555],[575,665],[1150,1160],[700,580],[685,595],
|
11
|
+
[685,610],[770,610],[795,645],[720,635],[760,650],[475,960],
|
12
|
+
[95,260],[875,920],[700,500],[555,815],[830,485],[1170,65],
|
13
|
+
[830,610],[605,625],[595,360],[1340,725],[1740,245]], 15, 50, 256)[:cost]).to be >= 7542
|
14
|
+
end
|
15
|
+
end
|
@@ -0,0 +1,24 @@
|
|
1
|
+
# coding: utf-8
|
2
|
+
lib = File.expand_path('../lib', __FILE__)
|
3
|
+
$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
|
4
|
+
require 'taboo_search/version'
|
5
|
+
|
6
|
+
Gem::Specification.new do |spec|
|
7
|
+
spec.name = "taboo_search"
|
8
|
+
spec.version = TabooSearch::VERSION
|
9
|
+
spec.authors = ["no-glue"]
|
10
|
+
spec.email = ["nikola_pav@eunet.rs"]
|
11
|
+
spec.description = %q{taboo search to solve travelling salesman}
|
12
|
+
spec.summary = %q{taboo search to solve travelling salesman}
|
13
|
+
spec.homepage = ""
|
14
|
+
spec.license = "MIT"
|
15
|
+
|
16
|
+
spec.files = `git ls-files`.split($/)
|
17
|
+
spec.executables = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
|
18
|
+
spec.test_files = spec.files.grep(%r{^(test|spec|features)/})
|
19
|
+
spec.require_paths = ["lib"]
|
20
|
+
|
21
|
+
spec.add_development_dependency "bundler", "~> 1.3"
|
22
|
+
spec.add_development_dependency "rake"
|
23
|
+
spec.add_development_dependency "rspec"
|
24
|
+
end
|
metadata
ADDED
@@ -0,0 +1,98 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: taboo_search
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.0.1
|
5
|
+
platform: ruby
|
6
|
+
authors:
|
7
|
+
- no-glue
|
8
|
+
autorequire:
|
9
|
+
bindir: bin
|
10
|
+
cert_chain: []
|
11
|
+
date: 2013-12-20 00:00:00.000000000 Z
|
12
|
+
dependencies:
|
13
|
+
- !ruby/object:Gem::Dependency
|
14
|
+
name: bundler
|
15
|
+
requirement: !ruby/object:Gem::Requirement
|
16
|
+
requirements:
|
17
|
+
- - ~>
|
18
|
+
- !ruby/object:Gem::Version
|
19
|
+
version: '1.3'
|
20
|
+
type: :development
|
21
|
+
prerelease: false
|
22
|
+
version_requirements: !ruby/object:Gem::Requirement
|
23
|
+
requirements:
|
24
|
+
- - ~>
|
25
|
+
- !ruby/object:Gem::Version
|
26
|
+
version: '1.3'
|
27
|
+
- !ruby/object:Gem::Dependency
|
28
|
+
name: rake
|
29
|
+
requirement: !ruby/object:Gem::Requirement
|
30
|
+
requirements:
|
31
|
+
- - ! '>='
|
32
|
+
- !ruby/object:Gem::Version
|
33
|
+
version: '0'
|
34
|
+
type: :development
|
35
|
+
prerelease: false
|
36
|
+
version_requirements: !ruby/object:Gem::Requirement
|
37
|
+
requirements:
|
38
|
+
- - ! '>='
|
39
|
+
- !ruby/object:Gem::Version
|
40
|
+
version: '0'
|
41
|
+
- !ruby/object:Gem::Dependency
|
42
|
+
name: rspec
|
43
|
+
requirement: !ruby/object:Gem::Requirement
|
44
|
+
requirements:
|
45
|
+
- - ! '>='
|
46
|
+
- !ruby/object:Gem::Version
|
47
|
+
version: '0'
|
48
|
+
type: :development
|
49
|
+
prerelease: false
|
50
|
+
version_requirements: !ruby/object:Gem::Requirement
|
51
|
+
requirements:
|
52
|
+
- - ! '>='
|
53
|
+
- !ruby/object:Gem::Version
|
54
|
+
version: '0'
|
55
|
+
description: taboo search to solve travelling salesman
|
56
|
+
email:
|
57
|
+
- nikola_pav@eunet.rs
|
58
|
+
executables: []
|
59
|
+
extensions: []
|
60
|
+
extra_rdoc_files: []
|
61
|
+
files:
|
62
|
+
- .gitignore
|
63
|
+
- Gemfile
|
64
|
+
- LICENSE.txt
|
65
|
+
- README.md
|
66
|
+
- Rakefile
|
67
|
+
- lib/taboo_search.rb
|
68
|
+
- lib/taboo_search/version.rb
|
69
|
+
- spec/spec_helper.rb
|
70
|
+
- spec/taboo_search_spec.rb
|
71
|
+
- taboo_search.gemspec
|
72
|
+
homepage: ''
|
73
|
+
licenses:
|
74
|
+
- MIT
|
75
|
+
metadata: {}
|
76
|
+
post_install_message:
|
77
|
+
rdoc_options: []
|
78
|
+
require_paths:
|
79
|
+
- lib
|
80
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
81
|
+
requirements:
|
82
|
+
- - ! '>='
|
83
|
+
- !ruby/object:Gem::Version
|
84
|
+
version: '0'
|
85
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
86
|
+
requirements:
|
87
|
+
- - ! '>='
|
88
|
+
- !ruby/object:Gem::Version
|
89
|
+
version: '0'
|
90
|
+
requirements: []
|
91
|
+
rubyforge_project:
|
92
|
+
rubygems_version: 2.1.11
|
93
|
+
signing_key:
|
94
|
+
specification_version: 4
|
95
|
+
summary: taboo search to solve travelling salesman
|
96
|
+
test_files:
|
97
|
+
- spec/spec_helper.rb
|
98
|
+
- spec/taboo_search_spec.rb
|