Total Complexity | 0 |
Total Lines | 19 |
Duplicated Lines | 0 % |
Changes | 0 |
1 | # encoding=utf8 |
||
2 | # This is temporary fix to import module from parent folder |
||
3 | # It will be removed when package is published on PyPI |
||
4 | import sys |
||
5 | sys.path.append('../') |
||
6 | # End of fix |
||
7 | |||
8 | import random |
||
9 | from NiaPy.algorithms.basic import FishSchoolSearch |
||
10 | from NiaPy.task import StoppingTask |
||
11 | from NiaPy.benchmarks import Sphere |
||
12 | |||
13 | #we will run Fish School Search for 5 independent runs |
||
14 | for i in range(5): |
||
15 | task = StoppingTask(D=10, nFES=10000, benchmark=Sphere()) |
||
16 | algo = FishSchoolSearch(NP=20) |
||
17 | best = algo.run(task) |
||
18 | print('%s -> %f' % (best[0], best[1])) |
||
19 | |||
20 |