feat: Added circular shift mutation & fixed .csv write issue

Author: Agrover112

fliscopt/ga.py

@@ -6,7 +6,7 @@
 from .utils.util import plot_scores, print_schedule, read_file
 from .base_algorithm import FlightAlgorithm,random
 from .rs import RandomSearch
-from .utils.ga_utils import crossover, mutation
+from .utils.ga_utils import crossover, mutation, circular_mutation
 from .fitness import *
 import random
 import heapq

fliscopt/multiproc.py

@@ -9,7 +9,7 @@
 from .utils.util import read_file
 
 from .fitness import *
-from .ga import GA,ReverseGA, GAReversals
+from .ga import GA, GARSReversals,ReverseGA, GAReversals
 
 import rich
 
@@ -26,7 +26,7 @@ def multiple_runs(algorithm, domain, fitness_function, init=[], record=False, n_
 
 
         f = open(os.path.join(os.getcwd()+'/results/multi_proc/' + fitness_function.__name__ + '/' +
-                            algorithm.__name__ + "_results.csv"), 'a+')
+                            algorithm.__name__ + "_results.csv"), 'a+',newline='\n')
 
         d = domain
         fn = fitness_function
@@ -58,6 +58,7 @@ def multiple_runs(algorithm, domain, fitness_function, init=[], record=False, n_
                     r[4]) + "\n")
             f.close()
         else: 
+            f.close()
             rich.print("[bold red]Run_Number[/bold red]\t[bold green]Solution[bold green]\t      [bold magenta]Cost[/bold magenta]  [bold magenta]NFE[/bold magenta] SEED", )
             for i, r in enumerate(res):
                 print(i, r[0], r[1], r[3], r[4])
@@ -69,6 +70,6 @@ def multiple_runs(algorithm, domain, fitness_function, init=[], record=False, n_
 
 if __name__ == '__main__':
     read_file('flights.txt')
-    multiple_runs(ReverseGA, domain['griewank']*12, griewank, record=False, n=10)
+    multiple_runs(GA, domain['domain'], fitness_function, record=True, n=10)
 
 

fliscopt/utils/ga_utils.py

@@ -16,6 +16,10 @@ def mutation(domain, step, solution) -> list:
             mutant = solution[0:gene]+[solution[gene]+step]+solution[gene+1:]
     return mutant
 
+def circular_mutation(domain, step,shift, solution) -> list:
+    #Cirulcar shift by shift places  & then mutate normally 
+    return mutation(domain, step, solution[shift:] + solution[:shift])
+
 # No good results tbh( also doesn't work for benchmarks yet) #FIX-NEEDED
 def multi_mutation(domain, step, solution) -> list:
     li = [i for i in range(domain[0][0], domain[0][1]+1)]
@@ -41,4 +45,6 @@ def multi_mutation(domain, step, solution) -> list:
 
     return mutant
 
-
+if __name__ == "__main__":
+    #print(circular_mutation([[0, 10], [0, 10]], 1, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]))
+    print(circular_mutation([(1, 10)]*10, 1,1, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]))