-
Notifications
You must be signed in to change notification settings - Fork 0
/
traveling_salesman.py
257 lines (195 loc) · 7.4 KB
/
traveling_salesman.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
import math
import random
from PIL import Image, ImageDraw
debug = False
fitness_calculator = None
class FitnessCalculator:
def score_fitness(self, individual):
"""
Compares the genes of a given individual to check them against the target individual, seeing how many match
"""
return 1 / individual.get_total_distance()
class TravelPlan:
def __init__(self):
self.cities = []
self.distance = 0
self.fitness = 0
def add_city(self, city):
self.cities.append(city)
def get_city(self, index):
return self.cities[index]
def set_city(self, index, city_to_set):
self.cities[index] = city_to_set
def set_cities(self, city_plan):
for city in city_plan.cities:
self.add_city(city)
def set_city_list(self, cities):
self.cities = cities
def size(self):
return len(self.cities)
def randomize(self):
random.shuffle(self.cities)
def get_total_distance(self):
if not self.distance:
from_city = self.cities[0]
for city in self.cities:
self.distance += from_city.distance_to(city)
from_city = city
# add in distance for return to start city
self.distance += from_city.distance_to(self.cities[0])
return self.distance
class City:
def __init__(self):
self.x = 0
self.y = 0
def set_location(self, x, y):
self.x = x
self.y = y
def distance_to(self, destination_city):
x_distance = math.fabs(self.x - destination_city.x)
y_distance = math.fabs(self.y - destination_city.y)
distance = math.sqrt((x_distance * x_distance) + (y_distance * y_distance))
return distance
class CityList:
list_size = 20
def __init__(self):
self.cities = []
def add_city(self, city):
self.cities.append(city)
def get_city(self, index):
try:
return self.cities[index]
except IndexError:
return None
def size(self):
return len(self.cities)
def populate_list(self):
for i in xrange(CityList.list_size):
city = City()
city.set_location(random.randint(1, 500), random.randint(1, 500))
self.add_city(city)
class Population:
def __init__(self, population_size, init):
self.individuals = []
if not init:
return
for i in xrange(population_size):
self.individuals.append(TravelPlan())
def add_individual(self, individual):
self.individuals.append(individual)
def get_individual(self, index):
return self.individuals[index]
def get_fittest(self):
"""
Finds the fittest individual in this Population by scoring them all
"""
fittest = self.individuals[0]
for individual in self.individuals:
if fitness_calculator.score_fitness(individual) > fitness_calculator.score_fitness(fittest):
fittest = individual
return fittest
def get_random(self):
"""
Gets a random member of this Population
"""
return random.choice(self.individuals)
def size(self):
return len(self.individuals)
class Algorithm:
def __init__(self):
self.mutation_rate = 0.015
self.elitism = True
self.tournament_size = 5
def evolve_population(self, population):
"""
Evolves a given population into a new one
It does this by conditionally preserving the fittest individual, and then
crossing over existing Individuals into new ones. Finally, it may mutate
Individuals based on the Algorithm's mutation_rate.
"""
new_population = Population(population.size(), False)
elitism_offset = 0
if self.elitism:
new_population.add_individual(population.get_fittest())
elitism_offset = 1
for i in xrange(elitism_offset, population.size()):
individual1 = self.tournament_selection(population)
individual2 = self.tournament_selection(population)
new_individual = self.crossover(individual1, individual2)
new_population.add_individual(new_individual)
for count, individual in enumerate(new_population.individuals):
if self.elitism and count == 0:
continue
self.mutate(individual)
return new_population
def mutate(self, individual):
"""
Checks to see if a given Individual should be mutated and mutates
by switching two elements randomly
"""
if random.random() <= self.mutation_rate:
individual.distance = 0
index1 = random.randint(0, individual.size() - 1)
index2 = random.randint(0, individual.size() - 1)
while index1 == index2:
index2 = random.randint(0, individual.size() - 1)
element1 = individual.get_city(index1)
element2 = individual.get_city(index2)
individual.set_city(index1, element2)
individual.set_city(index2, element1)
def crossover(self, individual1, individual2):
"""
Crosses two Individuals into one new one
"""
hybrid = TravelPlan()
index1 = random.randint(0, individual1.size() - 1)
index2 = random.randint(0, individual1.size() - 1)
ind1_subset = individual1.cities[index1:index2]
for city in individual2.cities:
if not city in ind1_subset:
ind1_subset.append(city)
hybrid.set_city_list(ind1_subset)
return hybrid
def tournament_selection(self, population):
"""
Creates a temporary 'tournament' Population from which to select a strong
individual from. The tournament Population is generally a subset of the
provided Population.
"""
tournament = Population(self.tournament_size, False)
for i in xrange(self.tournament_size):
tournament.add_individual(population.get_random())
return tournament.get_fittest()
def render_route(cities):
im = Image.new('RGBA', (500, 500), (255, 255, 255, 0))
draw = ImageDraw.Draw(im)
for city in cities:
draw.ellipse((city.x - 5, city.y - 5, city.x + 5, city.y + 5), fill=(0, 0, 0))
from_city = cities[0]
for city in cities:
draw.line((from_city.x, from_city.y, city.x, city.y), fill=0)
from_city = city
im.show()
if __name__ == '__main__':
fitness_calculator = FitnessCalculator()
algorithm = Algorithm()
# build random list of cities
city_list = CityList()
city_list.populate_list()
test_route = TravelPlan()
test_route.set_cities(city_list)
initial_distance = float(test_route.get_total_distance())
render_route(city_list.cities)
population = Population(20, True)
for i in xrange(population.size()):
tp = population.get_individual(i)
tp.set_cities(city_list)
tp.randomize()
population.add_individual(tp)
for i in xrange(1, 2500):
population = algorithm.evolve_population(population)
final_distance = population.get_fittest().get_total_distance()
print 'Initial distance: ' + str(initial_distance)
print 'Final distance: ' + str(final_distance)
print 'Improvement: ' + str(final_distance / initial_distance)
render_route(population.get_fittest().cities)