chavalitros/MH-P1
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Refactor neighbourhood exploration

Browse Source
This commit is contained in:
coolneng 2021-04-15 20:12:05 +02:00
parent e3c55ca89f
commit 193e9046eb
Signed by: coolneng
GPG Key ID: 9893DA236405AF57
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/processing.py
View File

@ -82,11 +82,14 @@ def get_random_solution(previous, data):
def explore_neighbourhood(element, data, max_iterations=100000):
neighbour = DataFrame()
neighbourhood = []
neighbourhood.append(element)
for _ in range(max_iterations):
neighbour, stop_condition = get_random_solution(element, data)
if stop_condition:
previous_solution = neighbourhood[-1]
neighbour = get_random_solution(previous=previous_solution, data=data)
if neighbour.equals(previous_solution):
break
neighbourhood.append(neighbour)
return neighbour