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

Select m random elements as the first solution

This commit is contained in:
coolneng 2021-04-13 23:01:37 +02:00
parent bf7ca7f520
commit b3211ff682
Signed by: coolneng
GPG Key ID: 9893DA236405AF57
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/processing.py
View File

@ -1,7 +1,7 @@
from preprocessing import parse_file from preprocessing import parse_file
from numpy.random import choice, randint, seed
from pandas import DataFrame, Series from pandas import DataFrame, Series
from sys import argv from sys import argv
from random import seed, randint
from time import time from time import time
@ -59,10 +59,10 @@ def greedy_algorithm(n, m, data):
return solutions return solutions
def get_pseudorandom_solution(n, data): def get_first_random_solution(m, data):
seed(42) seed(42)
solution = data.iloc[randint(a=0, b=n)] random_indexes = choice(len(data.index), size=m)
return Series(data={"point": solution["destination"], "distance": 0}) return data.iloc[random_indexes]
def local_search(n, m, data): def local_search(n, m, data):