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 AgingNpDifferentialEvolution |
||
10 | from NiaPy.algorithms.basic.de import bilinear |
||
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=10000, optType=OptimizationType.MINIMIZATION, benchmark=Sphere()) |
||
17 | algo = AgingNpDifferentialEvolution(NP=40, F=0.63, CR=0.9, Lt_min=3, Lt_max=7, omega=0.2, delta_np=0.1, age=bilinear) |
||
18 | best = algo.run(task=task) |
||
19 | print('%s -> %s' % (best[0].x, best[1])) |
||
20 | |||
22 |