Passed
Pull Request — master (#202)
by Grega
01:02
created

run_mtsv1.simple_example()   A

Complexity

Conditions 2

Size

Total Lines 6
Code Lines 6

Duplication

Lines 0
Ratio 0 %

Importance

Changes 0
Metric Value
cc 2
eloc 6
nop 9
dl 0
loc 6
rs 10
c 0
b 0
f 0

How to fix   Many Parameters   

Many Parameters

Methods with many parameters are not only hard to understand, but their parameters also often become inconsistent when you need more, or different data.

There are several approaches to avoid long parameter lists:

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.other import MultipleTrajectorySearchV1
10
from NiaPy.util import StoppingTask, OptimizationType
11
from NiaPy.benchmarks import Sphere
12
13
# we will run Nelder Mead algorithm for 5 independent runs
14
for i in range(5):
15
	task = StoppingTask(D=10, nGEN=40, optType=OptimizationType.MINIMIZATION, benchmark=Sphere())
16
	algo = MultipleTrajectorySearchV1()
17
	best = algo.run(task=task)
18
	print('%s -> %s' % (best[0], best[1]))
19
20
# vim: tabstop=3 noexpandtab shiftwidth=3 softtabstop=3
21