-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathevaluator.py
158 lines (135 loc) · 4.02 KB
/
evaluator.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
import individual
import random
import statistics
import tour
import copy
import math
from timeit import default_timer as timer
from router import Router
class Evaluator:
def __init__(self, gph, numTours):
# variables
self.version = 3.0
self.graph = gph
self.numTours = numTours
self.router = Router(self.graph, numTours)
self.depotNode = 0
self.routerStats = statistics.Statistics()
self.timeStats = statistics.Statistics()
self.count = 0
self.bestRouter = None
self.bestObjective = None
self.bestEncoding = []
self.bestDecoding = []
self.bestEvalCount = 0
self.seed = 0000
# encoding
self.geneLength = round(math.sqrt(len(self.router.heuristics))) # num bits (1 bits = 2 heuristics) (2 bits = 4 heursitics) (3 bits = 8 heuristics)
self.chromeLength = self.graph.size_e() * self.geneLength
self.minAllele = 0
self.maxAllele = 3
def reset(self):
self.routerStats.clear()
self.timeStats.clear()
self.count = 0
self.bestRouter = None
self.bestObjective = None
self.bestEncoding = []
self.bestDecoding = []
self.bestEvalCount = 0
def to_string(self, delimiter = ",", ending = '\n'):
data = [
self.GetProblemName(),
self.graph.size_e(),
self.numTours,
self.seed,
self.bestObjective,
round(self.timeStats.sum, 3),
self.bestEvalCount
]
for k in range(len(self.router.tours)):
data.append(self.bestRouter.tours[k].cost)
formatted = ''
for i in range(len(data)):
formatted += str(data[i])
if i < len(data) - 1:
formatted += delimiter
else:
formatted += ending
return formatted
def save(self, path, save_best_routes = False):
f = open(path, "a")
f.write(self.to_string())
f.close()
if save_best_routes:
self.bestRouter.save()
def GetProblemName(self):
return self.graph.name
def setSeed(self, seed):
random.seed(seed)
self.router.setSeed(seed)
self.seed = seed
def getRandomString(self):
# make array using base 0 indicies not size of actual data
temp = []
for i in range(self.chromeLength):
temp.append(random.randint(0, 1))
return temp
def binToDec(self, binary):
decimal = 0
count = 0
for i in binary:
if i == 1:
decimal += pow(2, count)
count += 1
return decimal
def decode(self, encoding):
decoding = []
for i in range(0, len(encoding), self.geneLength):
decoding.append(self.binToDec(encoding[i: i + self.geneLength]))
return decoding
def storeIfBest(self, router, encoding, decoding, count):
# keep track of the shortest tour
longestTourLength = router.getLengthOfLongestTour()
if self.bestRouter == None:
self.bestRouter = Router(self.graph, len(router.tours))
self.bestRouter.copy(router)
self.bestObjective = longestTourLength
self.bestEncoding = []
for b in encoding:
self.bestEncoding.append(b)
self.bestDecoding = []
for d in decoding:
self.bestDecoding.append(d)
self.bestEvalCount = count
return True
elif longestTourLength < self.bestObjective:
self.bestRouter.copy(router)
self.bestObjective = longestTourLength
self.bestEncoding = []
for b in encoding:
self.bestEncoding.append(b)
self.bestDecoding = []
for d in decoding:
self.bestDecoding.append(d)
self.bestEvalCount = count
return True
return False
def evaluate(self, encodedData):
# start a timer
self.count += 1
start = timer()
decoding = self.decode(encodedData)
self.router.clear()
for k_i in range(self.numTours):
k_depot = self.graph.size_v() - (k_i - (math.floor(k_i/4)*4)) - 1
self.router.addVertexToTour(k_depot, self.router.tours[k_i])
self.router.processHeuristicSequence(decoding)
for k_i in range(self.numTours):
k_depot = self.graph.size_v() - (k_i - (math.floor(k_i/4)*4)) - 1
self.router.addVertexToTour(k_depot, self.router.tours[k_i])
# end time track stats
time_elapsed = timer() - start
self.timeStats.addValue(time_elapsed)
self.storeIfBest(self.router, encodedData, decoding, self.count)
return 1/self.router.getLengthOfLongestTour(), self.router.getLengthOfLongestTour(), time_elapsed, self.router.data_str()