-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFinalProjectChecker.py
146 lines (113 loc) · 4.81 KB
/
FinalProjectChecker.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
import json
import csv
travel_rate = 20000/60
time_start = 0
time_end = 60*24*7 + 120
max_delivery_time = 60*4
loc_str = 'location'
arv_str = 'arrival'
dep_str = 'departure'
csv_file = 'FinalProject.csv'
f = open(csv_file, 'r')
reader = csv.reader(f)
next(reader)
data = [[float(i[j]) for j in range(len(i))] for i in reader]
loc_file = 'Locations.json'
f = open(loc_file, 'r')
loc = json.load(f)
if len(loc) != 20:
raise ValueError('{} does not contain enough entries'.format(loc_file))
loc_dict = {i[0]: tuple(i[1]) for i in loc}
sched_file = 'Schedule.json'
f = open(sched_file, 'r')
sched = json.load(f)
if len(sched) != 4:
raise ValueError('{} does not contain enough entries'.format(sched_file))
s_list = []
r_list = []
def makeFullSchedule(sched):
def make_dict_entry(i, j):
location = sched[i][j][0]
departure = sched[i][j][1]
if departure > time_end:
raise ValueError('departure time of {} is outside time window'.format(departure))
if j == 0:
arrival = 0
else:
prev_loc = sched[i][j-1][0]
prev_time = sched[i][j-1][1]
x1, y1 = loc_dict[prev_loc]
x2, y2 = loc_dict[location]
distance = abs(x2 - x1) + abs(y2 - y1)
travel_time = distance/travel_rate
arrival = prev_time + travel_time
if arrival + 30 > departure:
if j == 0:
print(departure)
else:
print(prev_loc, prev_time, j, sched[i][j-1])
error_string = 'courier {} needs 30 min window at {}: departs at {} arrives at {}'
raise ValueError(error_string.format(i, location, departure, arrival))
return {loc_str: location, arv_str: arrival, dep_str: departure}
sched_dict = [{make_dict_entry(i, j)[arv_str]: make_dict_entry(i, j)
for j in range(len(sched[i]))}
for i in range(len(sched))]
return sched_dict
sched_dict = makeFullSchedule(sched)
def computeCustomerObj(customer_info, max_delivery_time):
time = customer_info[0]
start_point = (customer_info[1], customer_info[2])
dest_point = (customer_info[3], customer_info[4])
couriers = [i for i in range(len(sched_dict))]
def compute_dist(p1, p2):
x1, y1 = p1
x2, y2 = p2
return abs(x2 - x1) + abs(y2 - y1)
start_dist_dict = {compute_dist(start_point, loc_dict[i]): i for i in loc_dict.keys()}
start_loc = start_dist_dict[min(start_dist_dict.keys())]
dest_dist_dict = {compute_dist(dest_point, loc_dict[i]): i for i in loc_dict.keys()}
dest_loc = dest_dist_dict[min(dest_dist_dict.keys())]
def courier_delivery_time(courier):
courier_sched = sched_dict[courier]
arrival_times = [courier_sched[i][arv_str] for i in courier_sched
if (courier_sched[i][arv_str] < time + max_delivery_time)
and (courier_sched[i][dep_str] > time)
and (courier_sched[i][loc_str] == start_loc)]
if arrival_times:
min_arrival_time = min(arrival_times)
else:
return False
destination_times = [courier_sched[i][arv_str] for i in courier_sched
if (courier_sched[i][arv_str] < time + max_delivery_time)
and (courier_sched[i][dep_str] > min_arrival_time)
and (courier_sched[i][loc_str] == dest_loc)]
if destination_times:
return min(destination_times)
else:
return False
min_deliverable_time = max([courier_delivery_time(i) for i in couriers])
if min_deliverable_time:
dist = (1/100)*(compute_dist(start_point, loc_dict[start_loc]) +
(1/2)*compute_dist(dest_point, loc_dict[dest_loc]))
probability = 1.2**-(1+dist)
else:
probability = 0
return probability
#----------------------------------------------------------------------------------------
d_list = []
for i in data:
if abs(computeCustomerObj(i, 2*60) - computeCustomerObj(i, 4*60)) > 0.01:
d_list.append(i)
#bjective_value = sum([computeCustomerObj(i, 60*4) for i in data])
#print(objective_value)
#----------------------------------------------------------------------------------------
def compute_dist(p1, p2):
x1, y1 = p1
x2, y2 = p2
return abs(x1-x2) + abs(y1-y2)
for i in d_list:
s_dist_list = [ compute_dist(i[1:3], j[1]) for j in loc]
val, s_idx = min((val, idx) for (idx, val) in enumerate(s_dist_list))
d_dist_list = [ compute_dist(i[3:5], j[1]) for j in loc]
val, d_idx = min((val, idx) for (idx, val) in enumerate(d_dist_list))
print([s_idx, d_idx])