comments

Author: mackoo13

algorithm/algorithm.py

@@ -16,13 +16,18 @@ def __init__(self, n, m, e, nep, nsp, ngh, max_iter):
  @staticmethod
  def execute(data):
 
- n = 5
- m = 3
- e = 1
- nep = 4
- nsp = 2
- ngh = 1
- max_iter = 9
+ """
+ :param data:
+ :return: score of the best solution found
+ """
+
+ n = 55
+ m = 7
+ e = 2
+ nep = 44
+ nsp = 27
+ ngh = 5
+ max_iter = 122
 
  pool = [AlgorithmUtils.random_solution(data) for _ in range(n)]
 

algorithm/utils.py

@@ -6,6 +6,19 @@ class AlgorithmUtils:
 
  @staticmethod
  def random_solution(data):
+ """
+ TODO to jest oczywiscie bez sensu i do zmiany
+ Wbrew pozorom problem generowania losowego rozwiazania nie jest trywialny - pamietajmy, ze bierzemy pod uwage
+ tylko poprawne rozwiazania i najlepiej by bylo losowac je z rownym prawdopodobienstwem
+
+ Sprowadza sie to do wylosowania takiego zbioru
+
+ Oczywiscie mozna generowac wszystkie mozliwe zbiory... ale przy duzych danych lepiej tego uniknac
+
+ :param data:
+ :return:
+ """
+
  res = dict()
  for ids in range(data.amount_of_cache_servers):
  random_video = random.randint(0, len(data.videos_sizes)-1)

main.py

@@ -6,7 +6,8 @@ def main():
  # input_file = "files/videos_worth_spreading.in"
  # input_file = "files/kittens.in"
  # input_file = "files/example1.in"
- input_file = "files/trending_today.in"
+ input_file = "files/me_at_the_zoo.in"
+ # input_file = "files/trending_today.in"
 
  # solution_file = "files/example1.out"
  # solution = check_solution(input_file, solution_file)