-
Notifications
You must be signed in to change notification settings - Fork 0
/
MeyersonS.py
131 lines (116 loc) · 3.91 KB
/
MeyersonS.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
import random
import math
import numpy as np
import time
def dist(x,y,dimension):
distance=0
x=x.split()
y=y.split()
for i in range(0,dimension):
xtal=float(x[i])
ytal=float(y[i])
distance+=distance+(xtal-ytal)**2
return math.sqrt(distance)
def closest_node_dist(node, nodes):
#print(node, nodes)
nodes = np.asarray(nodes)
deltas = nodes - node
dist_2 = np.einsum('ij,ij->i', deltas, deltas)
#print(dist_2)
return math.sqrt(min(dist_2))
#If we want to calculate the sum of the actual distances to closest center and not just the assigned one
def actualcost(data, facilities):
sum1=0.0
for x in data:
sum1+=closest_node_dist(x,facilities)
return sum1
def meyerson(data, dimension, f,facil,overcount):
data= np.random.permutation(data)
#print(data[0:10])
#setfacil = set(facil)
#print('agurk')
#print(setfacil)
#print(type(setfacil))
facilities= []
cost=0
counter=0
numberofcenters=0
for point in data:
#print(point)
counter=counter+1
#if counter % 100==0:
#print(counter)
#find nearest facility
if numberofcenters>0:
nearest = closest_node_dist(point,facilities)
#print(nearest)
else:
nearest = f+1
#print('hej')
if random.uniform(0,1)*f<nearest:
#open center at this point
#print('agurk')
#facilities = np.append(facilities, point)
facilities.append(point)
cost=cost+f
if isin(facil,point):
#print('already a facil')
overcount+=1
#print(overcount)
else:
numberofcenters+=1
else:
cost=cost+nearest
#print(counter)
#cost=actualcost(data,facilities)+f*numberofcenters
return facilities,cost,numberofcenters,overcount
def isin(list1,x):
for y in list1:
if np.array_equal(x,y):
return True
return False
def meyersonmanytimes(data, dimension, f, times,facil,overcount):
minimum=meyerson(data,dimension,f,facil,overcount)
for i in range(1,times):
run=meyerson(data,dimension,f,facil,overcount)
if run[1]<minimum[1]:
minimum=run
return minimum
def DFL(data,dimension,f,n,timesrecompute,window,filename):
filename='S'+filename
g = open(filename,'w+')
currentdata=data[:1000]
lastcost=0
currentcost=0
lasttime=0
overcount=0
howlong=-1
TotalRecompute=0
currentfacil=[]
TotalNumberofCentersOpened=0
start = time.time()
for i in range(0,n-window):
currentdata=data[i:i+window]
if i-lasttime>howlong:
lastfacil,lastcost,holder,overcount=meyersonmanytimes(currentdata,dimension,f,timesrecompute,currentfacil,overcount)
howlong=4*lastcost/f
TotalNumberofCentersOpened+=holder
#print(howlong)
lasttime=i
currentcost=lastcost
TotalRecompute+=1
currentfacil=lastfacil
else:
#print(data[i-1],currentfacil)
currentcost-=closest_node_dist(data[i-1],currentfacil)
nearest=closest_node_dist(data[i+window-1],currentfacil)
if nearest<f:
currentcost=currentcost+nearest
else:
currentcost=currentcost+f
TotalNumberofCentersOpened+=1
currentfacil.append(data[i+window-1])
#print(currentcost, costReMey)
if i%100==0:
print(i,TotalNumberofCentersOpened,currentcost, time.time()-start,howlong,overcount)
g.write(str(i)+ " "+str(currentcost)+ " " + str(TotalNumberofCentersOpened) + " "+ str(time.time()-start)+ '\n')