maggicl/AICup
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

local search

Browse source
This commit is contained in:
UmbertoJr 2019-11-18 06:59:05 +01:00
parent 32ca4e97fa
commit dad6b9bca5
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/local_search.py
View file

@ -11,7 +11,7 @@ class TwoOpt:
def step2opt(solution, matrix_dist, distance):
"""
One step of 2opt, one double loop and return first improved sequence
@param tsp_sequence:
@param solution:
@param matrix_dist:
@param distance:
@return:
@ -47,7 +47,7 @@ class TwoOpt:
def loop2opt(solution, instance, max_num_of_uncrosses=400): # Iterate step2opt max_iter times (2-opt local search)
"""
@param tsp_sequence:
@param solution:
@param instance:
@param max_num_of_uncrosses:
@return:
@ -73,7 +73,7 @@ class TwoDotFiveOpt:
def step2dot5opt(solution, matrix_dist, distance):
"""
One step of 2opt, one double loop and return first improved sequence
@param tsp_sequence:
@param solution:
@param matrix_dist:
@param distance:
@return:
@ -128,7 +128,7 @@ class TwoDotFiveOpt:
def loop2dot5opt(solution, instance, max_num_of_changes=400): # Iterate stoep2opt max_iter times (2-opt local search)
"""
@param tsp_sequence:
@param solution:
@param instance:
@param max_num_of_changes:
@return: