class Battery_capacity_hill_decent():
'''
Associate each house with the nearest battery, then hill descent the violation of battery capacity.
'''
def __init__(self, district_id):
if district_id == 1:
self.district = district_1
elif district_id == 2:
self.district = district_2
elif district_id == 3:
self.district = district_3
elif district_id == 4:
self.district = district_4
else:
return False
self.world = Configuration(district_id)
self.batteries = self.district["batteries"]
self.houses = self.district["houses"]
self.costs = 0
self.violation = 0
def Update_violation(self):
'''
Update the violation of battery capacities.
'''
violation = 0
self.costs = 0
for battery in self.batteries:
violation += max(0,(battery.energy_production - battery.capacity)) ** 2
self.costs += battery.costs_battery
self.violation = violation
def reset_world(self):
'''
Empty all batteries.
'''
for battery in self.batteries:
battery.empty_battery()
self.costs = 0
def distribute_houses(self):
'''
Associate each house with the nearest battery.
'''
for house in self.houses:
mindist = float('inf')
i=0
while(i < len(self.batteries)):
dist = abs(self.batteries[i].position_x - house.position_x) + abs(self.batteries[i].position_y - house.position_y)
if dist < mindist:
mindist = dist
minindex = i
i += 1
self.batteries[minindex].add_house(house)
self.Update_violation()
def Relocate_random_house(self):
'''
Relocates a random house from one battery to another, then updates the battery violation.
'''
initial_violation = self.violation
# Choose two different random batteries.
b_1 = np.random.randint(0, len(self.batteries))
while len(self.batteries[b_1].houses_in_battery) == 0:
b_1 = np.random.randint(0, len(self.batteries))
b_2 = np.random.randint(0, len(self.batteries))
while b_2 == b_1:
b_2 = np.random.randint(0, len(self.batteries))
# Choose a random house in the first battery and relocate it to the second battery if this results in a lower violation of
# battery capacity.
h_1 = np.random.randint(0, len(self.batteries[b_1].houses_in_battery))
violation_dif_1 = max(0,(self.batteries[b_1].energy_production - self.batteries[b_1].capacity \
- self.batteries[b_1].houses_in_battery[h_1].production)) ** 2 - max(0,(self.batteries[b_1].energy_production \
- self.batteries[b_1].capacity)) ** 2
violation_dif_2 = max(0,(self.batteries[b_2].energy_production - self.batteries[b_2].capacity + \
self.batteries[b_1].houses_in_battery[h_1].production)) ** 2 - max(0,(self.batteries[b_2].energy_production - \
self.batteries[b_2].capacity)) ** 2
violation_dif = violation_dif_1 + violation_dif_2
if violation_dif < 0:
self.batteries[b_2].add_house(self.batteries[b_1].houses_in_battery[h_1])
self.batteries[b_1].remove_house(self.batteries[b_1].houses_in_battery[h_1])
self.Update_violation()
def Find_valid_sol_1(self):
'''
Runs algorithm and return False if it gets stuck (if hill decent fails).
'''
same = 0
while self.violation > 0 and same < 100:
violation = self.violation
self.Relocate_random_house()
if violation == self.violation:
same += 1
else:
same = 0
if self.violation > 0:
self.reset_world()
return False
def run(self):
'''
Repeats the algorithm untill it is not stuck.
'''
self.distribute_houses()
while self.Find_valid_sol_1() == False:
self.distribute_houses()
return self.world.check50_neighbour_variant_own_costs()
class Random_house_sort():
'''
Random solution that doesn't violate battery capacities.
'''
def __init__(self, district_id):
if district_id == 1:
self.district = district_1
elif district_id == 2:
self.district = district_2
elif district_id == 3:
self.district = district_3
elif district_id == 4:
self.district = district_4
else:
return False
self.batteries = []
self.world = Configuration(district_id)
lists = self.world.get_lists()
for battery0 in lists[0]:
self.batteries.append(battery0[2])
self.houses = self.district["houses"]
self.costs = 0
def distribute_houses(self):
'''
Associate each house with a random battery.
'''
for house in self.houses:
done = False
negmaxcapacityleft = 0
for battery in self.batteries:
negcapleft = battery.energy_production - battery.capacity
if negcapleft < negmaxcapacityleft:
negmaxcapacityleft = negcapleft
maxcapleft = -negmaxcapacityleft
if maxcapleft < house.production:
return False
while done == False:
index = np.random.randint(0, len(self.batteries))
if self.batteries[index].capacity - self.batteries[index].energy_production > house.production:
self.batteries[index].add_house(house)
done = True
for battery in self.batteries:
self.costs += battery.costs_battery
return True
def reset_world(self):
'''
Empties batteries (disassociates all houses from batteries).
'''
for battery in self.batteries:
battery.empty_battery()
self.costs = 0
def run(self):
'''
Runs algorithm
'''
valid = False
while valid == False:
self.reset_world()
valid = self.distribute_houses()
return self.world.check50_neighbour_variant_own_costs()
