| Total Complexity | 0 |
| Total Lines | 20 |
| 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 AgingNpMultiMutationDifferentialEvolution |
||
| 10 | from NiaPy.algorithms.basic.de import CrossCurr2Best1, CrossBest2 |
||
| 11 | from NiaPy.util import StoppingTask, OptimizationType |
||
| 12 | from NiaPy.benchmarks import Sphere |
||
| 13 | |||
| 14 | #we will run Differential Evolution for 5 independent runs |
||
| 15 | for i in range(5): |
||
| 16 | task = StoppingTask(D=10, nFES=5000, optType=OptimizationType.MINIMIZATION, benchmark=Sphere()) |
||
| 17 | algo = AgingNpMultiMutationDifferentialEvolution(NP=10, F=0.2, CR=0.65, strategies=(CrossCurr2Best1, CrossBest2), delta_np=0.05, omega=0.9) |
||
| 18 | best = algo.run(task=task) |
||
| 19 | print('%s -> %s' % (best[0].x, best[1])) |
||
| 20 |