-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtruckloader.py
163 lines (137 loc) · 7.56 KB
/
truckloader.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
# Contains algorithm for truck loading
import datetime
import packagehash
# Runs in O(n) time, where n is the sub-grouping of packages to be searched.
# Simple nearest neighbor search
def get_closest_package(location, package_list, packages, distances):
closest_package = 0
closest_distance = float("inf")
for p in package_list:
distance_to_package = distances.get_distance(
location, packagehash.PackageHash.get_package(packages, p).get_address())
if distance_to_package < closest_distance:
closest_package = p
closest_distance = distance_to_package
return [closest_package, closest_distance]
# Runs in O(n) time, where n is the sub-grouping of packages to be searched.
# Finds the closest package that is further away from the Hub.
# The intent is to try and take care of farther destinations when possible so later trucks don't have to drive as far.
def get_closest_outward_package(location, package_list, packages, distances):
closest_package = 0
closest_distance = float("inf")
for p in package_list:
distance_to_package = distances.get_distance(
location, packagehash.PackageHash.get_package(packages, p).get_address())
if distance_to_package < closest_distance and distances.get_distance(
"HUB", packagehash.PackageHash.get_package(packages, p).get_address()) > \
distances.get_distance("HUB", location):
closest_package = p
closest_distance = distance_to_package
return [closest_package, closest_distance]
class TruckLoader:
_load_limit = 0
_drivers = 0
_start_time = 0
_vehicle_speed = 0
def __init__(self, drivers, load_limit, start_time, truck_speed):
self._drivers = drivers
self._load_limit = load_limit
self._start_time = start_time
self._vehicle_speed = truck_speed
# Runs in O(n*n) time for large n where n is the number of packages
def load_onto_truck(self, target_truck, location, package_list,
packages, distances, depth_first, optional_packages):
new_location = location
while len(package_list) > 0 and len(target_truck.delivery_queue) < self._load_limit:
# find next package
if (self._load_limit - len(target_truck.delivery_queue)) == len(package_list):
result = get_closest_package(location, package_list, packages, distances)
elif depth_first:
result = get_closest_outward_package(location, package_list + optional_packages, packages, distances)
if result[0] == 0:
result = get_closest_package(location, package_list + optional_packages, packages, distances)
else:
result = get_closest_package(location, package_list + optional_packages, packages, distances)
if result[1] > 0:
result = get_closest_package(location, package_list, packages, distances)
next_package = result[0]
new_location = packages.get_package(next_package).get_address()
target_truck.load_package(packages.get_package(next_package))
if next_package in package_list:
package_list.remove(next_package)
else:
optional_packages.remove(next_package)
# update truck's departure time
if target_truck.get_earliest_departure() < packages.get_package(next_package).get_requested_departure():
target_truck.set_earliest_departure(packages.get_package(next_package).get_requested_departure())
return new_location
# Runs in O(kn*n) time for large n where k >= 2.
def load_trucks(self, trucks, packages, distances):
# Assumption: we have enough trucks for all packages
# Assumption: we don't want to re-load any trucks mid-day
# Create a bucket for each truck and an additional bucket for available packages
package_bucket = []
truck_bucket = [[] for _ in range(len(trucks))]
# Copy package ids into their requested buckets to be loaded to trucks
# Runs in O(n) time.
for p in packages:
if len(p.get_requested_truck()) > 0:
truck_bucket[int(p.get_requested_truck()) - 1].append(p.get_id())
else:
package_bucket.append(p.get_id())
for t in range(len(trucks)):
truck_location = "HUB"
# find any early packages for this truck and pull out into a list
# tries to load early packages onto truck 1
early_packages = []
for p in range(len(truck_bucket[t])):
p_id = truck_bucket[t][p]
if packages.get_package(p_id).get_deadline() != "EOD":
early_packages.append(truck_bucket[t][p])
for p in range(len(package_bucket)):
p_id = package_bucket[p]
if packages.get_package(p_id).get_deadline() != "EOD":
early_packages.append(package_bucket[p])
for i in early_packages:
if i in truck_bucket[t]:
truck_bucket[t].remove(i)
elif i in package_bucket:
package_bucket.remove(i)
trucks[t].early_package_count = len(early_packages)
# peel off packages in groups by delivery time, then run greedy on those subgroups from last location
while len(early_packages) > 0:
current_earliest = datetime.datetime.max
current_list = []
for p in range(len(early_packages)):
p_id = early_packages[p]
if packages.get_package(p_id).get_deadline() < current_earliest:
current_list.clear()
current_earliest = packages.get_package(p_id).get_deadline()
current_list.append(p_id)
elif packages.get_package(p_id).get_deadline() == current_earliest:
current_list.append(p_id)
truck_location = self.load_onto_truck(trucks[t], truck_location, current_list, packages, distances,
False, truck_bucket[t] + package_bucket)
# remove any packages on the truck from the early list
for p in trucks[t].delivery_queue:
if p.get_id() in early_packages:
early_packages.remove(p.get_id())
if p.get_id() in package_bucket:
package_bucket.remove(p.get_id())
if p.get_id() in truck_bucket[t]:
truck_bucket[t].remove(p.get_id())
# repeats process until early packages are loaded
# finish truck-specific packages
if len(truck_bucket[t]) > 0:
self.load_onto_truck(trucks[t], truck_location,
truck_bucket[t], packages, distances, True, package_bucket)
for p in trucks[t].delivery_queue:
if p.get_id() in package_bucket:
package_bucket.remove(p.get_id())
# pass package_bucket to be loaded to the truck until truck is full or bucket runs out
if len(package_bucket) > 0:
self.load_onto_truck(trucks[t], truck_location,
package_bucket, packages, distances, True, [])
for p in trucks[t].delivery_queue:
if p.get_id() in package_bucket:
package_bucket.remove(p.get_id())