pymoo 0.6.1.3__cp311-cp311-win_amd64.whl → 0.6.1.5.dev0__cp311-cp311-win_amd64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- pymoo/algorithms/moo/age.py +13 -7
- pymoo/algorithms/moo/age2.py +49 -19
- pymoo/algorithms/moo/ctaea.py +2 -2
- pymoo/algorithms/moo/kgb.py +9 -9
- pymoo/algorithms/moo/nsga3.py +2 -2
- pymoo/algorithms/moo/pinsga2.py +370 -0
- pymoo/algorithms/moo/rnsga3.py +2 -2
- pymoo/algorithms/soo/nonconvex/es.py +3 -2
- pymoo/config.py +1 -1
- pymoo/core/algorithm.py +1 -1
- pymoo/core/individual.py +8 -7
- pymoo/core/replacement.py +5 -5
- pymoo/core/survival.py +1 -1
- pymoo/core/variable.py +9 -9
- pymoo/cython/calc_perpendicular_distance.cp311-win_amd64.pyd +0 -0
- pymoo/cython/calc_perpendicular_distance.cpp +27467 -0
- pymoo/cython/calc_perpendicular_distance.pyx +67 -0
- pymoo/cython/decomposition.cp311-win_amd64.pyd +0 -0
- pymoo/cython/decomposition.cpp +28877 -0
- pymoo/cython/decomposition.pyx +165 -0
- pymoo/cython/hv.cp311-win_amd64.pyd +0 -0
- pymoo/cython/hv.cpp +27559 -0
- pymoo/cython/hv.pyx +18 -0
- pymoo/cython/info.cp311-win_amd64.pyd +0 -0
- pymoo/cython/info.cpp +6653 -0
- pymoo/cython/info.pyx +5 -0
- pymoo/cython/mnn.cp311-win_amd64.pyd +0 -0
- pymoo/cython/mnn.cpp +30117 -0
- pymoo/cython/mnn.pyx +273 -0
- pymoo/cython/non_dominated_sorting.cp311-win_amd64.pyd +0 -0
- pymoo/cython/non_dominated_sorting.cpp +35256 -0
- pymoo/cython/non_dominated_sorting.pyx +645 -0
- pymoo/cython/pruning_cd.cp311-win_amd64.pyd +0 -0
- pymoo/cython/pruning_cd.cpp +29277 -0
- pymoo/cython/pruning_cd.pyx +197 -0
- pymoo/cython/stochastic_ranking.cp311-win_amd64.pyd +0 -0
- pymoo/cython/stochastic_ranking.cpp +27872 -0
- pymoo/cython/stochastic_ranking.pyx +49 -0
- pymoo/cython/vendor/hypervolume.cpp +1621 -0
- pymoo/docs.py +1 -1
- pymoo/operators/crossover/ox.py +1 -1
- pymoo/operators/selection/rnd.py +2 -2
- pymoo/operators/selection/tournament.py +5 -5
- pymoo/optimize.py +2 -2
- pymoo/problems/dynamic/df.py +4 -4
- pymoo/problems/single/traveling_salesman.py +1 -1
- pymoo/util/misc.py +2 -2
- pymoo/util/mnn.py +2 -2
- pymoo/util/nds/fast_non_dominated_sort.py +5 -3
- pymoo/util/nds/non_dominated_sorting.py +2 -2
- pymoo/util/normalization.py +5 -8
- pymoo/util/ref_dirs/energy.py +4 -2
- pymoo/util/ref_dirs/reduction.py +1 -1
- pymoo/util/reference_direction.py +3 -2
- pymoo/util/value_functions.py +719 -0
- pymoo/util/vf_dominator.py +99 -0
- pymoo/version.py +1 -1
- pymoo/visualization/heatmap.py +3 -3
- pymoo/visualization/pcp.py +1 -1
- pymoo/visualization/radar.py +1 -1
- {pymoo-0.6.1.3.dist-info → pymoo-0.6.1.5.dev0.dist-info}/METADATA +12 -13
- {pymoo-0.6.1.3.dist-info → pymoo-0.6.1.5.dev0.dist-info}/RECORD +65 -45
- {pymoo-0.6.1.3.dist-info → pymoo-0.6.1.5.dev0.dist-info}/WHEEL +1 -1
- {pymoo-0.6.1.3.dist-info → pymoo-0.6.1.5.dev0.dist-info/licenses}/LICENSE +0 -0
- {pymoo-0.6.1.3.dist-info → pymoo-0.6.1.5.dev0.dist-info}/top_level.txt +0 -0
|
@@ -0,0 +1,49 @@
|
|
|
1
|
+
# distutils: language = c++
|
|
2
|
+
# cython: language_level=2, boundscheck=False, wraparound=False, cdivision=True
|
|
3
|
+
|
|
4
|
+
|
|
5
|
+
import numpy as np
|
|
6
|
+
|
|
7
|
+
|
|
8
|
+
def stochastic_ranking(double[:] f, double[:] phi, double pr, long[:] I=None):
|
|
9
|
+
if I is None:
|
|
10
|
+
I = np.arange(len(f))
|
|
11
|
+
return np.array(c_stochastic_ranking(f, phi, pr, I))
|
|
12
|
+
|
|
13
|
+
|
|
14
|
+
|
|
15
|
+
def c_stochastic_ranking(double[:] f, double[:] phi, double pr, long[:] I):
|
|
16
|
+
cdef int _lambda, i, j, at_least_one_swap
|
|
17
|
+
cdef double u
|
|
18
|
+
|
|
19
|
+
_lambda = len(f)
|
|
20
|
+
|
|
21
|
+
for i in range(_lambda):
|
|
22
|
+
|
|
23
|
+
at_least_one_swap = 0
|
|
24
|
+
|
|
25
|
+
for j in range(_lambda - 1):
|
|
26
|
+
|
|
27
|
+
u = np.random.random()
|
|
28
|
+
|
|
29
|
+
if u < pr or (phi[I[j]] == 0 and phi[I[j + 1]] == 0):
|
|
30
|
+
if f[I[j]] > f[I[j + 1]]:
|
|
31
|
+
c_swap(I, j, j + 1)
|
|
32
|
+
at_least_one_swap = 1
|
|
33
|
+
else:
|
|
34
|
+
if phi[I[j]] > phi[I[j + 1]]:
|
|
35
|
+
c_swap(I, j, j + 1)
|
|
36
|
+
at_least_one_swap = 1
|
|
37
|
+
|
|
38
|
+
if at_least_one_swap == 0:
|
|
39
|
+
break
|
|
40
|
+
|
|
41
|
+
return I
|
|
42
|
+
|
|
43
|
+
|
|
44
|
+
cdef c_swap(long[:] x, int a, int b):
|
|
45
|
+
cdef int tmp
|
|
46
|
+
tmp = x[a]
|
|
47
|
+
x[a] = x[b]
|
|
48
|
+
x[b] = tmp
|
|
49
|
+
|