pymoo 0.6.1.3__cp311-cp311-macosx_10_9_universal2.whl → 0.6.1.5.dev0__cp311-cp311-macosx_10_9_universal2.whl

pymoo/util/vf_dominator.py

@@ -0,0 +1,99 @@
+import numpy as np
+
+def get_relation(ind_a, ind_b):
+    return Dominator.get_relation(ind_a.F, ind_b.F, ind_a.CV[0], ind_b.CV[0])
+
+
+class VFDominator:
+
+    def __init__(self, algorithm):
+
+        self.algorithm = algorithm
+
+    @staticmethod
+    def get_relation(a, b, cva=None, cvb=None):
+
+        if cva is not None and cvb is not None:
+            if cva < cvb:
+                return 1
+            elif cvb < cva:
+                return -1
+
+        val = 0
+        for i in range(len(a)):
+            if a[i] < b[i]:
+                # indifferent because once better and once worse
+                if val == -1:
+                    return 0
+                val = 1
+            elif b[i] < a[i]:
+                # indifferent because once better and once worse
+                if val == 1:
+                    return 0
+                val = -1
+        return val
+
+    @staticmethod
+    def calc_domination_matrix_loop(F, G):
+
+        n = F.shape[0]
+        CV = np.sum(G * (G > 0).astype(float), axis=1)
+        M = np.zeros((n, n))
+        for i in range(n):
+            for j in range(i + 1, n):
+                M[i, j] = Dominator.get_relation(F[i, :], F[j, :], CV[i], CV[j])
+                M[j, i] = -M[i, j]
+
+        return M
+
+    def calc_domination_matrix(self, F, _F=None, epsilon=0.0):
+
+        if _F is None:
+            _F = F
+
+        # look at the obj for dom
+        n = F.shape[0]
+        m = _F.shape[0]
+
+        L = np.repeat(F, m, axis=0)
+        R = np.tile(_F, (n, 1))
+
+        smaller = np.reshape(np.any(L + epsilon < R, axis=1), (n, m))
+        larger = np.reshape(np.any(L > R + epsilon, axis=1), (n, m))
+    
+        non_dom = np.logical_and(smaller, np.logical_not(larger))
+        dom = np.logical_and(larger, np.logical_not(smaller))
+
+        if self.algorithm.vf_res is not None: 
+
+            # Figure out what the v2 value is 
+            v2 = self.algorithm.v2
+
+            # Get the value function
+            vf = self.algorithm.vf_res.vf
+
+            # How much does the DM value each solution?
+            F_vf = vf(F * -1)[:,np.newaxis]
+            _F_vf = vf(_F * -1)[:,np.newaxis]
+
+            # We want to compare each solution to the others 
+            Lv = np.repeat(F_vf, m, axis=0)
+            Rv = np.tile(_F_vf, (n, 1))
+            
+            # Which values are greater than (better) V2? 
+            gtv2 = np.reshape(Lv < v2, (n, m))
+            # Which values are less than (worst) V2? 
+            ltv2 = np.reshape(Rv > v2, (n, m))
+         
+            # If you are greater than V2, you dominate all those who are smaller than V2
+            split_by_v2 = np.logical_and(gtv2, ltv2)
+           
+            dom = np.logical_or(dom, split_by_v2)
+
+        M = non_dom * 1 \
+            + dom * -1
+       
+        return M
+
+
+

pymoo/version.py

@@ -1 +1 @@
-__version__ = "0.6.1.3"
+__version__ = "0.6.1.5.dev"

pymoo/visualization/heatmap.py

@@ -32,7 +32,7 @@ class Heatmap(Plot):
             If true large values are white and small values the corresponding color. Otherwise, the other way around.
 
         solution_labels : bool or list
-            If False no labels are plotted in the y axis. If true just the corresponding index. Otherwise the label provided.
+            If False no labels are plotted in the y axis. If true just the corresponding index. Otherwise, the label provided.
 
         bounds : {bounds}
 
@@ -97,11 +97,11 @@ class Heatmap(Plot):
         if self.solution_labels is None:
             pass
 
-        # in case just true just use a number for each solution
+        # if true, just use a number for each solution
         elif isinstance(self.solution_labels, bool) and self.solution_labels:
             self.solution_labels = np.arange(len(F)) + 1
 
-        # otherwise use directly the label provided
+        # otherwise, use directly the label provided
         else:
             if len(self.solution_labels) != len(F):
                 raise Exception(

pymoo/visualization/pcp.py

@@ -36,7 +36,7 @@ class PCP(Plot):
             Whether the value of the boundaries are shown in the plot or not.
 
         normalize_each_axis : bool
-            Whether the values should be normalized either by bounds or implictly.
+            Whether the values should be normalized either by bounds or implicitly.
 
         Other Parameters
         ----------------

pymoo/visualization/radar.py

@@ -21,7 +21,7 @@ class Radar(Plot):
         Parameters
         ----------------
         normalize_each_objective : bool
-            Whether each objective is normalized. Otherwise the inner and outer bound is plotted.
+            Whether each objective is normalized. Otherwise, the inner and outer bound is plotted.
         point_style : dict
             The style being used to visualize the points
         n_partitions : int

{pymoo-0.6.1.3.dist-info → pymoo-0.6.1.5.dev0.dist-info}/METADATA

@@ -1,37 +1,36 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.4
 Name: pymoo
-Version: 0.6.1.3
+Version: 0.6.1.5.dev0
 Summary: Multi-Objective Optimization in Python
-Home-page: https://pymoo.org
-Author: Julian Blank
-Author-email: blankjul@msu.edu
-License: Apache License 2.0
+Author-email: Julian Blank <blankjul@outlook.com>
+License-Expression: Apache-2.0
+Project-URL: homepage, https://pymoo.org
 Keywords: optimization
-Platform: any
 Classifier: Intended Audience :: Developers
 Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: OS Independent
-Classifier: License :: OSI Approved :: Apache Software License
 Classifier: Programming Language :: Python
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
 Classifier: Topic :: Scientific/Engineering
 Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: >=3.9
 Description-Content-Type: text/x-rst
 License-File: LICENSE
-Requires-Dist: numpy >=1.15
-Requires-Dist: scipy >=1.1
-Requires-Dist: matplotlib >=3
-Requires-Dist: autograd >=1.4
-Requires-Dist: cma ==3.2.2
+Requires-Dist: numpy>=1.19.3
+Requires-Dist: scipy>=1.1
+Requires-Dist: matplotlib>=3
+Requires-Dist: autograd>=1.4
+Requires-Dist: cma>=3.2.2
 Requires-Dist: alive-progress
 Requires-Dist: dill
 Requires-Dist: Deprecated
+Dynamic: license-file