remi/MDAF
1
0
Fork 0
mirror of https://github.com/ejeanboris/MDAF.git synced 2025-06-15 09:38:32 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fixed optimization space lower limit error

Browse Source
This commit is contained in:
Remi Ehounou
2021-09-11 16:53:22 -04:00
parent 6db3811864
commit b05666e137
4 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
MDAF/MDAF.py
View File

@ -279,7 +279,7 @@ def doe(heuristicpath, testfunctionpaths, heuristic_args, measurementSampleSize
failedfunctions[run] = process.exitcode
connections[run][0].close()
connections[run][1].close()
print('Test Function Completed: '+str(i)+'/'+str(len(proc)))
print('Test Function Completed: '+str(i+1)+'/'+str(len(proc)))
# display output

4
MDAF/SampleAlgorithms/SimmulatedAnnealing.py
View File

@ -39,14 +39,14 @@ def main(func, S, args):
t = args["t"]
p = args["p"]
high = args["upper"] if isinstance(args["upper"], int) else max(args["upper"])
low = args["lower"] if isinstance(args["lower"], int) else max(args["lower"])
low = args["lower"] if isinstance(args["lower"], int) else min(args["lower"])
Best = list()
Best[:] = cp.deepcopy(S)
sigma = 0.1
route.append(Best[:])
for iterationstep in range(100000):
print('\n\n\n')
#print('\n\n\n')
R = tweak(cp.deepcopy(S),p,sigma,high, low)
#print(R)
#print(S)

BIN
MDAF/SampleAlgorithms/__pycache__/SimmulatedAnnealing.cpython-39.pyc
View File

Binary file not shown.

2
tests/SimmulatedAnnealing.py
View File

@ -46,7 +46,7 @@ def main(func, S, args):
sigma = 0.1
route.append(Best[:])
while True:
print('\n\n\n')
#print('\n\n\n')
R = tweak(cp.deepcopy(S),p,sigma,high, low)
print(R)
print(S)