iterated_local_search 0.0.2
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 +29 -0
- data/Rakefile +6 -0
- data/iterated_local_search.gemspec +24 -0
- data/lib/iterated_local_search/version.rb +3 -0
- data/lib/iterated_local_search.rb +92 -0
- data/spec/iterated_local_search_spec.rb +15 -0
- data/spec/spec_helper.rb +6 -0
- metadata +98 -0
checksums.yaml
ADDED
@@ -0,0 +1,15 @@
|
|
1
|
+
---
|
2
|
+
!binary "U0hBMQ==":
|
3
|
+
metadata.gz: !binary |-
|
4
|
+
ZjVkMmJhYmUxNzhiYTg1N2JhNTY0MzJmYjIzM2M0MjQ1MjBjYjc3OQ==
|
5
|
+
data.tar.gz: !binary |-
|
6
|
+
YmFmYjg5MzY0Y2NhNTMyMjQ4ODExY2JhNTI1YjVmNTA1MjUwYjE2Zg==
|
7
|
+
SHA512:
|
8
|
+
metadata.gz: !binary |-
|
9
|
+
Y2FkMjFlMTM1YTI2ZTIyNzM3NGJjNDQwNDMzYjIxY2E3MzcwMDJiMGNhYTkw
|
10
|
+
YzYzMmUzMzJiNDJiOTQxOGQ2NGYyYmFjZDcyOWJhYTEzZDhiMjdmNjdmZmU0
|
11
|
+
Y2Y1N2EzNjIyZTliNTFmMGNlMjVlNTU2MTk3ZWQxOTFlNTY2MTA=
|
12
|
+
data.tar.gz: !binary |-
|
13
|
+
MjgxYmZmYTJjYjljMDIzMGRjZGQ0YWZiNWUxYjQ0YTkzNjg5NjkxNTY3NWJi
|
14
|
+
ZGE0YzRhNTYwMzFmOTE3M2NhNDE1ZmVlZjNhMmFjOWI2MjA2NDRmYTNhZDIz
|
15
|
+
MzdmMzFjOGFjMTYzMWNjNWZlOWNlZDU4ZWQ1NjJmYmM0MjQ1MWY=
|
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,29 @@
|
|
1
|
+
# IteratedLocalSearch
|
2
|
+
|
3
|
+
TODO: solves travelling salesman. tries to find shortes circuit.
|
4
|
+
|
5
|
+
## Installation
|
6
|
+
|
7
|
+
Add this line to your application's Gemfile:
|
8
|
+
|
9
|
+
gem 'iterated_local_search'
|
10
|
+
|
11
|
+
And then execute:
|
12
|
+
|
13
|
+
$ bundle
|
14
|
+
|
15
|
+
Or install it yourself as:
|
16
|
+
|
17
|
+
$ gem install iterated_local_search
|
18
|
+
|
19
|
+
## Usage
|
20
|
+
|
21
|
+
TODO: Write usage instructions here
|
22
|
+
|
23
|
+
## Contributing
|
24
|
+
|
25
|
+
1. Fork it
|
26
|
+
2. Create your feature branch (`git checkout -b my-new-feature`)
|
27
|
+
3. Commit your changes (`git commit -am 'Add some feature'`)
|
28
|
+
4. Push to the branch (`git push origin my-new-feature`)
|
29
|
+
5. Create new Pull Request
|
data/Rakefile
ADDED
@@ -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 'iterated_local_search/version'
|
5
|
+
|
6
|
+
Gem::Specification.new do |spec|
|
7
|
+
spec.name = "iterated_local_search"
|
8
|
+
spec.version = IteratedLocalSearch::VERSION
|
9
|
+
spec.authors = ["scriptical"]
|
10
|
+
spec.email = ["nikolapav1985@gmail.com"]
|
11
|
+
spec.description = %q{iterated local search to solve travelling salesman}
|
12
|
+
spec.summary = %q{iterated local 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
|
@@ -0,0 +1,92 @@
|
|
1
|
+
require "iterated_local_search/version"
|
2
|
+
|
3
|
+
module IteratedLocalSearch
|
4
|
+
class IteratedLocalSearch
|
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(permutation, cities)
|
12
|
+
distance = 0
|
13
|
+
permutation.each_with_index do |c1, i|
|
14
|
+
c2 = (i == (permutation.size - 1)) ? permutation[0] : permutation[i + 1]
|
15
|
+
# +++ get distance between two cities
|
16
|
+
distance += euc_2d cities[c1], cities[c2]
|
17
|
+
end
|
18
|
+
distance
|
19
|
+
end
|
20
|
+
|
21
|
+
# gets random permutation
|
22
|
+
def random_permutation(cities)
|
23
|
+
perm = Array.new(cities.size){|i| i}
|
24
|
+
|
25
|
+
perm.each_index do |i|
|
26
|
+
# +++ stays withing range, +- cancel each other
|
27
|
+
r = rand(perm.size - i) + i
|
28
|
+
perm[r], perm[i] = perm[i], perm[r]
|
29
|
+
end
|
30
|
+
perm
|
31
|
+
end
|
32
|
+
|
33
|
+
# gets reverse in range
|
34
|
+
def stochastic_two_opt(permutation)
|
35
|
+
perm = Array.new(permutation)
|
36
|
+
c1, c2 = rand(perm.size), rand(perm.size)
|
37
|
+
collection = [c1]
|
38
|
+
collection << ((c1 == 0 ? perm.size - 1 : c1 - 1))
|
39
|
+
collection << ((c1 == perm.size - 1) ? 0 : c1 + 1)
|
40
|
+
c2 = rand(perm.size) while collection.include? (c2)
|
41
|
+
c1, c2 = c2, c1 if c2 < c1
|
42
|
+
# +++ reverses in range
|
43
|
+
perm[c1...c2] = perm[c1...c2].reverse
|
44
|
+
perm
|
45
|
+
end
|
46
|
+
|
47
|
+
# rejoins array
|
48
|
+
def double_bridge_move(permutation)
|
49
|
+
pos1 = 1 + (permutation.size / 4)
|
50
|
+
pos2 = pos1 + 1 + rand(permutation.size / 4)
|
51
|
+
pos3 = pos2 + 1 + rand(permutation.size / 4)
|
52
|
+
p1 = permutation[0...pos1] + permutation[pos3...permutation.size]
|
53
|
+
p2 = permutation[pos2...pos3] + permutation[pos1...pos2]
|
54
|
+
p1 + p2
|
55
|
+
end
|
56
|
+
|
57
|
+
# does double bridge
|
58
|
+
def perturbation(cities, best)
|
59
|
+
candidate = {}
|
60
|
+
candidate[:vector] = double_bridge_move best[:vector]
|
61
|
+
candidate[:cost] = cost candidate[:vector], cities
|
62
|
+
candidate
|
63
|
+
end
|
64
|
+
|
65
|
+
# does two opt
|
66
|
+
def local_search(best, cities, max_no_improv)
|
67
|
+
count = 0
|
68
|
+
begin
|
69
|
+
candidate = {:vector => stochastic_two_opt(best[:vector])}
|
70
|
+
candidate[:cost] = cost(candidate[:vector], cities)
|
71
|
+
count = (candidate[:cost] < best[:cost]) ? 0 : count + 1
|
72
|
+
best = candidate if candidate[:cost] < best[:cost]
|
73
|
+
end until count >= max_no_improv
|
74
|
+
best
|
75
|
+
end
|
76
|
+
|
77
|
+
# does search
|
78
|
+
def search(cities, max_iterations, max_no_improv)
|
79
|
+
best = {}
|
80
|
+
best[:vector] = random_permutation cities
|
81
|
+
best[:cost] = cost best[:vector], cities
|
82
|
+
best = local_search best, cities, max_no_improv
|
83
|
+
max_iterations.times do |iter|
|
84
|
+
candidate = perturbation cities, best
|
85
|
+
candidate = local_search candidate, cities, max_no_improv
|
86
|
+
best = candidate if candidate[:cost] < best[:cost]
|
87
|
+
puts "iteration #{(iter + 1)}, best #{best[:cost]}"
|
88
|
+
end
|
89
|
+
best
|
90
|
+
end
|
91
|
+
end
|
92
|
+
end
|
@@ -0,0 +1,15 @@
|
|
1
|
+
require 'spec_helper'
|
2
|
+
|
3
|
+
describe IteratedLocalSearch do
|
4
|
+
it 'gets 7542 or greater for berlin' do
|
5
|
+
expect(IteratedLocalSearch::IteratedLocalSearch.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]], 100, 50)[:cost]).to be >= 7542
|
14
|
+
end
|
15
|
+
end
|
data/spec/spec_helper.rb
ADDED
metadata
ADDED
@@ -0,0 +1,98 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: iterated_local_search
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.0.2
|
5
|
+
platform: ruby
|
6
|
+
authors:
|
7
|
+
- scriptical
|
8
|
+
autorequire:
|
9
|
+
bindir: bin
|
10
|
+
cert_chain: []
|
11
|
+
date: 2013-12-17 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: iterated local search to solve travelling salesman
|
56
|
+
email:
|
57
|
+
- nikolapav1985@gmail.com
|
58
|
+
executables: []
|
59
|
+
extensions: []
|
60
|
+
extra_rdoc_files: []
|
61
|
+
files:
|
62
|
+
- .gitignore
|
63
|
+
- Gemfile
|
64
|
+
- LICENSE.txt
|
65
|
+
- README.md
|
66
|
+
- Rakefile
|
67
|
+
- iterated_local_search.gemspec
|
68
|
+
- lib/iterated_local_search.rb
|
69
|
+
- lib/iterated_local_search/version.rb
|
70
|
+
- spec/iterated_local_search_spec.rb
|
71
|
+
- spec/spec_helper.rb
|
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: iterated local search to solve travelling salesman
|
96
|
+
test_files:
|
97
|
+
- spec/iterated_local_search_spec.rb
|
98
|
+
- spec/spec_helper.rb
|