pymoo 0.6.1.1__cp311-cp311-macosx_10_9_universal2.whl → 0.6.1.2__cp311-cp311-macosx_10_9_universal2.whl

pymoo/util/nds/dominance_degree_non_dominated_sort.py

@@ -0,0 +1,159 @@
+"""Module which implements Dominance Degree Approaches for Non-dominated Sorting.
+
+For the original work see:
+    DDA-NS https://ieeexplore.ieee.org/document/7469397
+    DDA-ENS https://ieeexplore.ieee.org/document/9282978
+
+Adapted from https://github.com/rsenwar/Non-Dominated-Sorting-Algorithms/tree/master
+"""
+
+
+from typing import Literal, List
+import numpy as np
+
+
+def construct_comp_matrix(vec: np.ndarray, sorted_idx: np.ndarray) -> np.ndarray:
+    """
+    const_comp_mat construct the comparison matrix from a row-vector vec.
+
+    Parameters
+    ----------
+    vec : np.ndarray
+        The vector of scores for the population on a single objective
+    sorted_idx : np.ndarray
+        The indices which would sort `vec`
+
+    Returns
+    -------
+    np.ndarray
+        The comparison matrix indicating whether each member in the population dominates the other member for the
+        objective in `vec`
+    """
+    n = vec.shape[0]
+    c = np.zeros(shape=(n, n), dtype=np.int32)
+
+    # the elements of the b(0)-th row in C are all set to 1
+    c[sorted_idx[0], :] = 1
+
+    for i in range(1, n):
+        if vec[sorted_idx[i]] == vec[sorted_idx[i - 1]]:
+            # the rows in C corresponding to the same elements in w are identical
+            c[sorted_idx[i]] = c[sorted_idx[i - 1]]
+        else:
+            c[sorted_idx[i], sorted_idx[i:]] = 1
+
+    return c
+
+
+def construct_domination_matrix(f_scores: np.ndarray, **kwargs) -> np.ndarray:
+    """
+    construct_domination_matrix calculates the dominance degree matrix for a set of vectors.
+
+    The dominance degree indicate the degree of dominance of a solution, which is the number of
+    objectives for which it is the dominating solution.
+
+    Parameters
+    ----------
+    f_scores : np.ndarray
+        an N x M matrix of N (population size) objective function values for M objectives
+    """
+    d = np.zeros((f_scores.shape[0], f_scores.shape[0]), dtype=np.int32)
+    b = np.apply_over_axes(np.argsort, f_scores, axes=0)
+    for vec, srt in zip(f_scores.T, b.T):
+        d += construct_comp_matrix(vec, srt)
+    d = np.where(
+        np.logical_and(d == f_scores.shape[-1], d.T == f_scores.shape[-1]), 0, d
+    )
+    return d
+
+
+def dda_ns(f_scores: np.ndarray, **kwargs) -> List[List[int]]:
+    """
+    dda_ns runs the DDA-NS algorithm.
+
+    Parameters
+    ----------
+    f_scores : np.ndarray
+        an N x M matrix of N (population size) objective function values for M objectives
+
+    Returns
+    -------
+    List[List[int]]
+        A list of members of each Pareto front. The index in the outer most list corresponds to the level in the Pareto front
+        while the value in the inner-most list is the id of the member of the population belonging to that front.
+    """
+    d_mx = construct_domination_matrix(f_scores)
+    max_d = np.empty((f_scores.shape[0],), dtype=np.int32)
+
+    fronts = []
+    count = 0
+    while count < f_scores.shape[0]:
+        # Max(D) is the row vector containing the maximum elements from each column of D
+        np.max(d_mx, out=max_d, axis=0)
+        front = [i for i, m_d in enumerate(max_d) if 0 <= m_d < f_scores.shape[-1]]
+        count += len(front)
+        d_mx[front] = -1
+        d_mx[:, front] = -1
+        fronts.append(front)
+
+    return fronts
+
+
+def dda_ens(f_scores: np.ndarray, **kwargs) -> List[List[int]]:
+    """
+    dda_ens runs the DDA-ENS (efficient DDA) algorithm
+
+    Parameters
+    ----------
+    f_scores : np.ndarray
+        The N x M matrix of N (population size) objective function values for M objectives
+
+    Returns
+    -------
+    List[List[int]]
+        an N x M matrix of N (population size) objective function values for M objectives
+    """
+    d_mx = construct_domination_matrix(f_scores)
+
+    fronts: List[List[int]] = []
+    for s in np.lexsort(f_scores.T):
+        isinserted = False
+        for fk in fronts:
+            if not (d_mx[fk, s] == f_scores.shape[1]).any():
+                fk.append(s)
+                isinserted = True
+                break
+        if not isinserted:
+            fronts.append([s])
+    return fronts
+
+
+def dominance_degree_non_dominated_sort(
+    f_scores: np.ndarray, strategy: Literal["efficient", "fast"] = "efficient"
+) -> List[List[int]]:
+    """
+    dominance_degree_non_dominated_sort performs the non-dominating sort with the specified algorithm
+
+    Parameters
+    ----------
+    f_scores : np.ndarray
+        The N x M matrix of N (population size) objective function values for M objectives
+    strategy : Literal["efficient", "fast"], optional
+        The dominance degree algorithm to use, by default "efficient"
+
+    Returns
+    -------
+    List[List[int]]
+        A list of members of each Pareto front. The index in the outer most list corresponds to the level in the Pareto front
+        while the value in the inner-most list is the id of the member of the population belonging to that front.
+
+    Raises
+    ------
+    ValueError
+        If an invalid strategy is specified
+    """
+    if strategy == "efficient":
+        return dda_ens(f_scores)
+    if strategy == "fast":
+        return dda_ns(f_scores)
+    raise ValueError("Invalid search strategy")

pymoo/util/ref_dirs/__init__.py

@@ -1,6 +1,7 @@
 from pymoo.util.ref_dirs.energy import RieszEnergyReferenceDirectionFactory
 from pymoo.util.ref_dirs.energy_layer import LayerwiseRieszEnergyReferenceDirectionFactory
 from pymoo.util.ref_dirs.reduction import ReductionBasedReferenceDirectionFactory
+from pymoo.util.ref_dirs.incremental import IncrementalReferenceDirectionFactory
 from pymoo.util.reference_direction import MultiLayerReferenceDirectionFactory
 
 
@@ -14,6 +15,7 @@ def get_reference_directions(name, *args, **kwargs):
         "multi-layer": MultiLayerReferenceDirectionFactory,
         "layer-energy": LayerwiseRieszEnergyReferenceDirectionFactory,
         "reduction": ReductionBasedReferenceDirectionFactory,
+        "incremental": IncrementalReferenceDirectionFactory,
     }
 
     if name not in REF:

pymoo/util/ref_dirs/energy.py

@@ -1,7 +1,6 @@
 import numpy as np
-import pymoo.gradient.toolbox as anp
-
 
+from pymoo.gradient.grad_autograd import triu_indices, sqrt, log
 from pymoo.util.ref_dirs.construction import ConstructionBasedReferenceDirectionFactory
 from pymoo.util.ref_dirs.misc import project_onto_sum_equals_zero_plane, project_onto_unit_simplex_recursive
 from pymoo.util.ref_dirs.optimizer import Adam
@@ -280,9 +279,9 @@ def squared_dist(A, B):
 
 
 def calc_potential_energy(A, d):
-    i, j = anp.triu_indices(len(A), 1)
-    D = anp.sqrt(squared_dist(A, A)[i, j])
-    energy = anp.log((1 / D ** d).mean())
+    i, j = triu_indices(len(A), 1)
+    D = sqrt(squared_dist(A, A)[i, j])
+    energy = log((1 / D ** d).mean())
     return energy
 
 

pymoo/util/ref_dirs/energy_layer.py

@@ -1,7 +1,8 @@
-import autograd.numpy as anp
+
+
 import numpy as np
-from autograd import value_and_grad
 
+from pymoo.gradient.grad_autograd import value_and_grad, triu_indices, row_stack
 from pymoo.util.normalization import normalize
 from pymoo.util.ref_dirs.energy import squared_dist
 from pymoo.util.ref_dirs.optimizer import Adam
@@ -102,14 +103,14 @@ def get_points(X, scalings):
     vals = []
     for i in range(len(X)):
         vals.append(scale_reference_directions(X[i], scalings[i]))
-    X = anp.row_stack(vals)
+    X = row_stack(vals)
     return X
 
 
 def calc_potential_energy(scalings, X):
     X = get_points(X, scalings)
 
-    i, j = anp.triu_indices(len(X), 1)
+    i, j = triu_indices(len(X), 1)
     D = squared_dist(X, X)[i, j]
 
     if np.any(D < 1e-12):

pymoo/util/ref_dirs/incremental.py

@@ -0,0 +1,68 @@
+import numpy as np
+
+from pymoo.util.reference_direction import ReferenceDirectionFactory
+
+def check_n_points(n_points, n_dim):
+    """
+    Returns n_partitions or a numeric value associated with the exception message.
+    """
+
+    if n_dim == 1:
+        return [0]
+    
+    I = n_dim * np.eye(n_dim)
+    W = np.zeros((1, n_dim))
+    edgeW = W
+    i = 0
+
+    while len(W) < n_points:
+        edgeW = np.tile(edgeW, (n_dim, 1)) + np.repeat(I, edgeW.shape[0], axis=0)
+        edgeW = np.unique(edgeW, axis=0)
+        edgeW = edgeW [np.any(edgeW == 0, axis=1)]
+        W = np.vstack((W + 1, edgeW))
+        i += 1
+
+    if len(W) == n_points:
+        return [i]
+    
+    return  [len(W) - len(edgeW), i - 1, len(W), i]
+
+
+def incremental_lattice(n_partitions, n_dim):
+    I = n_dim * np.eye(n_dim)
+    W = np.zeros((1, n_dim))
+    edgeW = W
+
+    for _ in range(n_partitions):
+        edgeW = np.tile(edgeW, (n_dim, 1)) + np.repeat(I, edgeW.shape[0], axis=0)
+        edgeW = np.unique(edgeW, axis=0)
+        edgeW = edgeW [np.any(edgeW == 0, axis=1)]
+        W = np.vstack((W + 1, edgeW))
+
+    return W / (n_dim * n_partitions)
+
+class IncrementalReferenceDirectionFactory(ReferenceDirectionFactory):
+
+    def __init__(self, n_dim, scaling=None, n_points=None, n_partitions=None, **kwargs) -> None:
+        super().__init__(n_dim, scaling=scaling, **kwargs)
+
+        if n_points is not None:
+            results = check_n_points(n_points, n_dim)
+
+            # the number of points are not matching to any partition number
+            if len(results) > 1:
+                raise Exception("The number of points (n_points = %s) can not be created uniformly.\n"
+                                "Either choose n_points = %s (n_partitions = %s) or "
+                                "n_points = %s (n_partitions = %s)." %
+                                (n_points, results[0], results[1], results[2], results[3]))
+
+            self.n_partitions = results[0]
+
+        elif n_partitions is not None:
+            self.n_partitions = n_partitions
+
+        else:
+            raise Exception("Either provide number of partitions or number of points.")
+
+    def _do(self):
+        return incremental_lattice(self.n_partitions, self.n_dim)

pymoo/version.py

@@ -1 +1 @@
-__version__ = "0.6.1.1"
+__version__ = "0.6.1.2"

{pymoo-0.6.1.1.dist-info → pymoo-0.6.1.2.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: pymoo
-Version: 0.6.1.1
+Version: 0.6.1.2
 Summary: Multi-Objective Optimization in Python
 Home-page: https://pymoo.org
 Author: Julian Blank
@@ -14,11 +14,10 @@ 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.7
-Classifier: Programming Language :: Python :: 3.8
 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: Topic :: Scientific/Engineering
 Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
 Classifier: Topic :: Scientific/Engineering :: Mathematics

{pymoo-0.6.1.1.dist-info → pymoo-0.6.1.2.dist-info}/RECORD

@@ -2,7 +2,7 @@ pymoo/__init__.py,sha256=v67f70WmTZmKmlKYvMrMGQQ5WDnzpOkqsZayAB0wdIw,40
 pymoo/config.py,sha256=ac6bls9Oz4-NvR7xW_DVWmHaJHwKXGMisKe1NqwX3QE,909
 pymoo/docs.py,sha256=WvBHBNSuR0MMmyTHIuWuj92ORBH7ZVD9_2hGKdd5v1A,8666
 pymoo/optimize.py,sha256=g3KLa7vieXaMn_67Mx7UUGPYGt5OgEBI7xNzmVFKnRw,2338
-pymoo/version.py,sha256=nwyEh5NE8fNTLjPrE3HxIMYPuJSNdOo3hMzY8gggVng,24
+pymoo/version.py,sha256=6wTzaL7dAPbe2X_tjt03RwRPJPxNjEDtZy-kLuhCYkg,24
 pymoo/algorithms/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/algorithms/hyperparameters.py,sha256=dQgzTXEoMvSgFgRf44DTlALKYzf4pc4OarF5xVIZsKM,2504
 pymoo/algorithms/base/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -12,35 +12,35 @@ pymoo/algorithms/base/line.py,sha256=6dVtR-la_dpLqbJajw9eiRHK06SNM3PTIABgDhf-Avs
 pymoo/algorithms/base/local.py,sha256=_zal3sAId9Huf2s5awBJbKah9lrTwk1q8lpJRKMNmBY,1516
 pymoo/algorithms/base/meta.py,sha256=B_TkjlK4zgZBErzGYta07CXEoWY6EI3z4LWe9RWBrjY,1904
 pymoo/algorithms/moo/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pymoo/algorithms/moo/age.py,sha256=kIYMVnc4SIuw3vnmU891y6RzezGYio3bdCor_8p3dGU,10536
+pymoo/algorithms/moo/age.py,sha256=mbqdIZ3AAmBVgzMtaUsLs8PXb6z8KFFm5ETyE5AlRu8,10540
 pymoo/algorithms/moo/age2.py,sha256=KErmjMsOg5J6nojcnvtCK-RTgkiaE8nXdPi1lGNtlWM,5037
 pymoo/algorithms/moo/ctaea.py,sha256=oU00117hb4abs8aOaHhCqZkrqSfM8oddZJsTr9YzUnQ,12144
 pymoo/algorithms/moo/dnsga2.py,sha256=AraXJEdqVrYr91ugFVoGXGZEQi_SZIHNvJ9OfUa7s9w,2878
 pymoo/algorithms/moo/kgb.py,sha256=uL37sFL37o9fz2i4-eRJO4uAcNopoHw-3HhgmRYIjRs,16295
 pymoo/algorithms/moo/moead.py,sha256=NiTephgJSpyDnNV8Ex1U2Z7k8c1zPHTQYduHaJJ-aLk,7307
 pymoo/algorithms/moo/nsga2.py,sha256=_CWO2xDAxjYlfP78ImWRkRCPuIczphDxOhY00VNeBOg,4422
-pymoo/algorithms/moo/nsga3.py,sha256=Duo04Snvvh7fMdGW_KDjiWf1Kl3adJBpYS41wGtJIIo,13340
+pymoo/algorithms/moo/nsga3.py,sha256=sx7nBNRrYyMDvMcBqVSKBybqXPc4Eyj4BmDRCzXj2Sw,13339
 pymoo/algorithms/moo/rnsga2.py,sha256=8Id1vvOM4_NEDAFuzmqQjBEkNbksU0-SEuv0iTogGGE,7150
 pymoo/algorithms/moo/rnsga3.py,sha256=Q1bniIdgxk5lP3y-OIKE13jda5KCZatA0148HI9J7wE,9911
 pymoo/algorithms/moo/rvea.py,sha256=as8f6UY2Gjr6VXlDHhFXLJFou9BtoTNgzFl2Yi_SCb8,7860
-pymoo/algorithms/moo/sms.py,sha256=51LDzncG0nAqcn3PgFKqIeuRMzffHRpslR-pCpMk9MA,6948
+pymoo/algorithms/moo/sms.py,sha256=ozZzt0DH0DQdPiV5l1gq6CeleybKDNW19ikqGDXXRNk,6990
 pymoo/algorithms/moo/spea2.py,sha256=q0kQ3W34zlJuPEXOk7Z2ekO_UYBPFPZxJi4YJLHTw_I,7004
 pymoo/algorithms/moo/unsga3.py,sha256=KSLVzrDEPaBPMKqE76fo6GhALMLA9ZaAY91Mq9fkgj4,1628
 pymoo/algorithms/soo/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/algorithms/soo/convex/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/algorithms/soo/nonconvex/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/algorithms/soo/nonconvex/brkga.py,sha256=Fy2kyiTmlDH2yS44OQSvNoK5XF48zYmjwT-ETqSucNg,6419
-pymoo/algorithms/soo/nonconvex/cmaes.py,sha256=iLO5qj4WVmDJDUx7PDAPXAw13lsymA-Kpes7d7pA9Qg,19710
+pymoo/algorithms/soo/nonconvex/cmaes.py,sha256=YiFwsbIpbYfDWMlg6Dya5eo38-3U61o9B9f66Ue06Qc,19730
 pymoo/algorithms/soo/nonconvex/de.py,sha256=hlSqzxYv36gvEZ2oIwUdP-WuiP-E2lUlvgdvqYZbe50,10733
 pymoo/algorithms/soo/nonconvex/direct.py,sha256=GFEpNPTY3JKZsXvbGKYtdtbc2bNoiQfIWFt-NAHZNlQ,5193
-pymoo/algorithms/soo/nonconvex/es.py,sha256=WfeocdQNLs9TVTE71g-zSBoEctCSht49OYjMyd9nIj4,7238
+pymoo/algorithms/soo/nonconvex/es.py,sha256=MVT21-FtYDFKdiqFUmayX6IiLYGv278ohzgOsYuHQrw,7234
 pymoo/algorithms/soo/nonconvex/g3pcx.py,sha256=FBZT_VYhG8maIhY-ko7YeW2giCs29BEJHfiq3tYjIBw,3422
 pymoo/algorithms/soo/nonconvex/ga.py,sha256=xwAjOfP-NmY4ZI7yjuu2kfLp0a32H6EtTnpQMg7Lhtw,3476
 pymoo/algorithms/soo/nonconvex/ga_niching.py,sha256=SB9QvOpeqJAKXReHbR7UB9n2C7aBpAuxubxlHYFqbu0,8635
 pymoo/algorithms/soo/nonconvex/isres.py,sha256=eqS4pbaphcVhR-FBamnkvxi7QPkGkT0p0m6SVSaw1pI,2604
 pymoo/algorithms/soo/nonconvex/nelder.py,sha256=ta6aZtYl8TH94QOTYC9zYQXh_BLvCZ7UI2RkFwRW-Mc,9057
-pymoo/algorithms/soo/nonconvex/optuna.py,sha256=I7BcgfuRTSC-U6PKcuvFlBGDw7JO5AWry-HjHsFFWfs,2599
-pymoo/algorithms/soo/nonconvex/pattern.py,sha256=u05P4GRh50kx93Uuzg_k687JA7DPsG9AHlesQUVjrPE,6628
+pymoo/algorithms/soo/nonconvex/optuna.py,sha256=jN6Ax4cA7TvJaabg7tpF7FB853J9KVl05yinPN-1SWs,2586
+pymoo/algorithms/soo/nonconvex/pattern.py,sha256=86IzmcnodjOWix4x-qVthR1ygNp4sxPTQBfvDNDS7Wc,6619
 pymoo/algorithms/soo/nonconvex/pso.py,sha256=7p4Jbz96erXPApLrg5aq2C5lUOb-0xEdUskymiKxR9k,13399
 pymoo/algorithms/soo/nonconvex/pso_ep.py,sha256=2blPdKnVDujfUx_Z87k-0-uWTctqptc4_dXe5537xXM,10323
 pymoo/algorithms/soo/nonconvex/random_search.py,sha256=z5Hkx8PZ7OEdWP8XEOmpqYFUFeIjzQfeefkflPKfbVk,882
@@ -52,13 +52,13 @@ pymoo/algorithms/soo/univariate/golden.py,sha256=gYhnMiGcnA6QYNr5Br27W6prINfBmrc
 pymoo/algorithms/soo/univariate/quadr_interp.py,sha256=OKJGBfO7WcgOqsB4SZzB0_s7GLT5rswlNLY2_tPrOGs,2285
 pymoo/algorithms/soo/univariate/wolfe.py,sha256=gajHGGd75XFuVm7TPLleVuZoaoxxNCRT14HZwqTYZnI,5621
 pymoo/constraints/__init__.py,sha256=ajz1GSNU9xYVrFEDSz6Xwg7amWQ_yvW75tQa1ZvRIWc,3
-pymoo/constraints/adaptive.py,sha256=xvzbYc98VUTaSUui7MHrKiKNNpB7zYnF83oZ2ZV61fE,1894
+pymoo/constraints/adaptive.py,sha256=TB1sjWjYdAli_RJ7TcJRObu4uugx535S5giHVA6h48o,1934
 pymoo/constraints/as_obj.py,sha256=bvV9xE9n9UFiVwAzP2Lo7uIVpUz1CwFb9ZA_a8hhqSw,1533
 pymoo/constraints/as_penalty.py,sha256=H2w6PhmlVr0jeJJg1Iu_AWenQ4ip-9g3fNBzC3aR6Us,1181
-pymoo/constraints/eps.py,sha256=KbSU6jQZ3WFqYzpkVhIQy3xSwAAZvKwpF8NJy0hx1rc,789
+pymoo/constraints/eps.py,sha256=6TOjqBoDxUw5_iBC9BIvlfXrYgkOTjH-SgcVzOjqmJw,809
 pymoo/constraints/from_bounds.py,sha256=o2BPeM85jqUj5AWlaC7kb8z8tIDRLjlmYQuJTMRGsQQ,1017
 pymoo/core/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pymoo/core/algorithm.py,sha256=u2yq1t1y8ynhqfs-v1vqZot-de5RvdEZMwLYMWutTHM,12144
+pymoo/core/algorithm.py,sha256=hdF6hRTKwH_BpijIoZKYIQQVFBjSJIDDkvHVXVXViBE,12173
 pymoo/core/callback.py,sha256=9O17q9GajJjnK7zlh2cMegIdWULn878oWQ94A0YJ35Q,806
 pymoo/core/crossover.py,sha256=2wmj-WdpeYzuSCb9tr1Mi4X3GDM-yBbOPScX8DNCQGg,2713
 pymoo/core/decision_making.py,sha256=oR3PZpHH0tBcOFH3BiFGVo38nZ9oi050g9PfTMkGvfg,2972
@@ -66,7 +66,7 @@ pymoo/core/decomposition.py,sha256=Zg76SIQUzOZCnlXGQM92fqDmIShy-AzcFC-yD2UTtPw,2
 pymoo/core/duplicate.py,sha256=zxsE6teplj9T1FxjqZd68BpkwmCb-5s7LDCrwOCD-V4,4006
 pymoo/core/evaluator.py,sha256=eiEgbZgVBMuxjn8c1HHKOyncptKKr4qWYpjyEzSXByA,4157
 pymoo/core/indicator.py,sha256=eznhveORg6K6t5OwTk_MLsDv4Rzn0g6zNs2HJa-PibI,882
-pymoo/core/individual.py,sha256=Mkp1uUWli5pP9WbrEOVWAzFa9FkZxGFu-cp5Bt2G5pY,7096
+pymoo/core/individual.py,sha256=vLcCdsDnkxyWbO3E_3zfa-ad7en_ADY_UwpCotM_8Vk,20378
 pymoo/core/infill.py,sha256=jTz-x8m4ehisHt9C7-HfcySvYiaOCzaxC_jQbsyvAiU,2326
 pymoo/core/initialization.py,sha256=4O7F2R2Dr8DX1rLOLN1THeLw5IQ67jKi2boBvaoFwMA,1459
 pymoo/core/mating.py,sha256=4fG_iIUgTMrZ1n1sZe5ovGQ0a0SnxTIoCP6KiojOE0Y,1240
@@ -75,28 +75,28 @@ pymoo/core/mixed.py,sha256=ncQFIkdETojRqQN03mrsW_Bec70WSnmoR_W9c2Mc9Vc,5769
 pymoo/core/mutation.py,sha256=dUB6iUrG46-LIMpDAJYDBf0mqZ_ePEHfgrJp7M3xcnA,1300
 pymoo/core/operator.py,sha256=yiB5eglD_5HYRFGow_dsdL6G2rrFxbM7Sjaw0MNIIHA,937
 pymoo/core/parameters.py,sha256=hrGHRo3kMEONP4cVs4yuBcNv6Ba_djxkha0ZqXSyZ3c,3197
-pymoo/core/plot.py,sha256=ULu8wiZKxoSfewD10qZlN29yv-42_070Zfhx6p-DlyI,6114
+pymoo/core/plot.py,sha256=ErFe84Yg7Bq-uB94jkgPGyESwezJqthhsNypZHS8-4I,6118
 pymoo/core/population.py,sha256=pHh2L8dGT3kVNSvK6walPPYsV-On97jdSJFf0Ujt_Tw,4866
 pymoo/core/problem.py,sha256=4PIUuq2-XTrN-W6OnafdUZzl1RRrQFlq_6zX7dzWfrM,14006
 pymoo/core/recorder.py,sha256=STi_DNJyipNCyMPnZ5PFpYPJQtI3bd61yFXuV1AucFI,2394
 pymoo/core/repair.py,sha256=vliu7Nnn0yzxPXgerhvQL32GuLl82-bLAtPLXHeJdEM,431
 pymoo/core/replacement.py,sha256=bnomp-69ifba-VqP77xYP1V4q355-JmKKew9h-QdDPY,2801
-pymoo/core/result.py,sha256=FxBpvqqHQfhHIeOkX_mKdRXkZy5PvU3682F5WfrceDg,1152
+pymoo/core/result.py,sha256=eZ1_cy-oDPKHS0m7YZjJ9QUuUIuGgRxMURjDUZyOui8,1221
 pymoo/core/sampling.py,sha256=afTaU9nd5vdX-z5-_i6vBU23lBIrGwpI8G7rM83hJDU,1058
 pymoo/core/selection.py,sha256=cU8LoU-OEJAdeM6dFoqAt9ycbdSfCn3iNsnQFknDWIs,1841
 pymoo/core/solution.py,sha256=IQx4X2NmuCz-69o3AktLh8lzv0BJ6P21Hn1sm6TVHzE,171
 pymoo/core/survival.py,sha256=7md44ZBr7z-OcsJSzKg8xD7OHQVw5XVB3etvXPsaq1I,3073
 pymoo/core/termination.py,sha256=YQ7lIzeFupCdv1AZ509CRPoCEQx9JhEe4Ey8aom2tc0,1715
-pymoo/core/variable.py,sha256=zjrnfJ086BhXKB5D8BHqNa4tDA6fmW_SWjP8z1zBbaE,2201
+pymoo/core/variable.py,sha256=m0SFB-ZgnlZDEm9pj3KrBTL2T9J9xvj6qNvU4efeQkQ,10710
 pymoo/cython/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pymoo/cython/calc_perpendicular_distance.cpython-311-darwin.so,sha256=zSZdr8yvu9Eu_Lr3oi0KpJmSA4X7PG2IZhNQkGMYuds,448670
-pymoo/cython/decomposition.cpython-311-darwin.so,sha256=HixnMFvZItq53nCWfczff9SzAPYG8jYaUZH3DGEaxAk,516112
-pymoo/cython/hv.cpython-311-darwin.so,sha256=5OS2VZnFRPU1gOIVWOGoEJlMYzEUWMWNoiMlibMlWJU,505525
-pymoo/cython/info.cpython-311-darwin.so,sha256=b17pDDZ-tUhDgZiFLyxROulgZSabfTxA2S9XvqI8CtM,129319
-pymoo/cython/mnn.cpython-311-darwin.so,sha256=bkpuSnwYYWUhpHlJ_jmQ3jXC_C-KJ3L27AUpwkDBkes,520278
-pymoo/cython/non_dominated_sorting.cpython-311-darwin.so,sha256=WLPvWT4Gu0uQ3YIEryOa0rSVKuoaz2GK7Z2P8iOBiWU,592712
-pymoo/cython/pruning_cd.cpython-311-darwin.so,sha256=HXhn2JLcqnwUnV4H0EHbinMKvygU_NdPZnQ-8JaM_ZM,518973
-pymoo/cython/stochastic_ranking.cpython-311-darwin.so,sha256=E8GJ-n22BHw-OjUvphlMwuFzb9Ixer_bPgo9bk_p6kg,463637
+pymoo/cython/calc_perpendicular_distance.cpython-311-darwin.so,sha256=chAiHrP0jEIvosfEHeHkA-55cmoNMaCeLYuxuDBfU1A,408456
+pymoo/cython/decomposition.cpython-311-darwin.so,sha256=bCboFjF5l4BH4OGaWAK2XLKGP3hGbE80qSBH99CLn1Q,442296
+pymoo/cython/hv.cpython-311-darwin.so,sha256=NQDgQqv13bitebArS3wmkc1S10z5vuDOwSjunaPx7yY,447056
+pymoo/cython/info.cpython-311-darwin.so,sha256=l-coar2vSkEHp9krDd_KtBkMKd1D_MFwKU0bdRVq6sM,110960
+pymoo/cython/mnn.cpython-311-darwin.so,sha256=HR9lOvr3hZJSn9_9P9emEdKj0hNmCbiYuapVQtF22CA,461056
+pymoo/cython/non_dominated_sorting.cpython-311-darwin.so,sha256=T71WunI3bLF5Tuvf-pzLoZalg-xyrdOliY4OepXL6K8,549968
+pymoo/cython/pruning_cd.cpython-311-darwin.so,sha256=bMydT7Y4IeNUpL0TXzHV_6j09zVEDVAtVZeaAE33cZE,460536
+pymoo/cython/stochastic_ranking.cpython-311-darwin.so,sha256=7yUCuDe7I1D2L9h-VYS0hJ9mQN6-jw8brBDFzONkxYE,406176
 pymoo/cython/utils.pxd,sha256=55dXTlmQEWXwZlRTvTTkfFFnDFjyLqMCwHmZi5PB11k,2552
 pymoo/cython/vendor/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/cython/vendor/hypervolume.h,sha256=o5TVeXek-SwZuPnQqZJZf_Uh0iaOOquV7LpM3q5lyLo,2142
@@ -111,9 +111,9 @@ pymoo/decomposition/weighted_sum.py,sha256=HfH4AZ_RVvAgvmJ7_iKMYhvgAo_IGmFOa_mzb
 pymoo/experimental/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/experimental/algorithms/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/experimental/algorithms/gde3.py,sha256=e1vFMJAvQSCN-lhY3uSM8udfDArTKxXPuRZr_EDkqp0,2059
-pymoo/gradient/__init__.py,sha256=hRmdkooLzU3Y3k_qq0obi5JbrwO2PMY7WgLOJh1urVc,328
+pymoo/gradient/__init__.py,sha256=JgtqGrcVMwo7fKEynGiobZ3bfZklI7q3la43l3x2eqY,321
 pymoo/gradient/automatic.py,sha256=NkK0VefclTUeZVFIIK2zATJ5NPBGcXNjdBlylmnatDM,1905
-pymoo/gradient/grad_autograd.py,sha256=BC5I5kBkpPsb80GBMicUshqtuOuRaInVPGQHEWZTxGw,2109
+pymoo/gradient/grad_autograd.py,sha256=3M_zELHplj7Nkl36-ZFyoHP2W4bDbWKsUyKv40vGSj4,2596
 pymoo/gradient/grad_complex.py,sha256=zSdi5e2NC9AddvyylBoUCLKrPW7ZKH_RuzxO3IvP1tQ,1011
 pymoo/gradient/grad_jax.py,sha256=iKfwdnJWlUpxDxr3TpiMlFBPRj2XvJ1Dzr3jMRV3A6A,1115
 pymoo/gradient/toolbox/__init__.py,sha256=T0Zk87gXTWvHXTprdvRwtqv2rhjFpqnNjh8OVC2pP5s,122
@@ -245,7 +245,7 @@ pymoo/util/archive.py,sha256=ht1mNM21M9Jt4Hwa_CDbkpmcjzkY-O8sQTgfivIf_6M,4340
 pymoo/util/cache.py,sha256=CjiTzFd2MYvGFT_oFkmX4g85_nEVFvrSd_ADp5DcuXs,818
 pymoo/util/clearing.py,sha256=mkJpbk8QaS-3uVxjBYrciuW-O79_RjV6B8M0zwv4HOU,1744
 pymoo/util/dominator.py,sha256=RYRAXBfRU_8hvu6vd20nwNHYpaYEZhq0rRo518JV7m0,1806
-pymoo/util/function_loader.py,sha256=f-qfxc5HKh_O9tTAK3haNcy1We5u0de0t0oxest9FtQ,3965
+pymoo/util/function_loader.py,sha256=lu5V0ADjtAvcufjo2KpyGZKF2OMqg-ARwqD28olnDM8,4399
 pymoo/util/hv.py,sha256=bfEHFJg_D_wn0vQrkicxSgJn5PksMYcLCB5LD3M2IPw,418
 pymoo/util/matlab_engine.py,sha256=uF7kNIz5wqMAsbuiYbK2W80V7k28ZAejBiwUfpxbzqQ,1240
 pymoo/util/misc.py,sha256=XvK85BixGtokHt6YeNGjgUlDdl9P3XscVA62hinLXMQ,11128
@@ -270,17 +270,19 @@ pymoo/util/display/output.py,sha256=y-rp4v6NfgvlVZ3K1WZCBbt5Xv7x2LkgDzre8eR-4lw,
 pymoo/util/display/progress.py,sha256=vils5LvaRpFHUdr6dGAod2NGX1BM258x7N6mPcrIwM4,1247
 pymoo/util/display/single.py,sha256=jTm2G1BfV7pmy4fbMlHbAaz8HIXrUbjyfuTi0lsamn0,1773
 pymoo/util/nds/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pymoo/util/nds/dominance_degree_non_dominated_sort.py,sha256=xAO-X_lyy7zPO8USBmTfMqUrnSHE2JP1lfQiHT-0mAA,5149
 pymoo/util/nds/efficient_non_dominated_sort.py,sha256=z9zEtD8tJSA1jv6d88mVViP_Yh_zO5xnwSjCty5HX-o,3936
 pymoo/util/nds/fast_non_dominated_sort.py,sha256=scwCebYJWUZsGtn85TErxcxlUfyg34K9ndXkE-X51bs,1681
 pymoo/util/nds/naive_non_dominated_sort.py,sha256=miypwIaJ3ZrKCO2In-uER98VFB5wohlyPfaMFFxwT4o,822
 pymoo/util/nds/non_dominated_sorting.py,sha256=c4NwdE6-MUTKhVIC0aPA1yni-yXNna3NzieK7yEeS38,1927
 pymoo/util/nds/tree_based_non_dominated_sort.py,sha256=7Tl87EPwCzTfzDA-4RAQnI9x50VUZKbloiuZHNhqoSQ,3630
-pymoo/util/ref_dirs/__init__.py,sha256=dSNEb62AWsqzOK_jfJW-v-rc6wt5f_jSHmahvebUYHY,973
+pymoo/util/ref_dirs/__init__.py,sha256=h29b8CQJv0qUtXHZKcXNARdGKIHJmDI52sfMWtADdxk,1115
 pymoo/util/ref_dirs/construction.py,sha256=9PJgJDb1whdouu-mx0e10lyjgTxKA1F5EiNlZ_4DDT8,2729
 pymoo/util/ref_dirs/das_dennis.py,sha256=iZ2DXUcuetRWCvQ0GXjTqYHP9Zw-ZxenD1MG_V6YYNA,1500
-pymoo/util/ref_dirs/energy.py,sha256=gZvUpPjsTXc4cLzxEkjWtmiBfhvdT2uPEsfo-gYa6Hw,11550
-pymoo/util/ref_dirs/energy_layer.py,sha256=IxbsK-f2pPAVDVPa7syTiKz4WVo3wPsM2OM0i0CGCYc,3530
+pymoo/util/ref_dirs/energy.py,sha256=ZitTbhpTFn7Pb0m2Q4KakSvhPtEVPCf_pkvT5lhmziQ,11565
+pymoo/util/ref_dirs/energy_layer.py,sha256=AOUlL-gWeUcXpzNHghbjZofYo1LyxoTDmhUBPQnw-cY,3540
 pymoo/util/ref_dirs/genetic_algorithm.py,sha256=B8rH5guQKQxOtZY1JljACZNqpBA2SmNvjjgcAH_-7Cc,1928
+pymoo/util/ref_dirs/incremental.py,sha256=BDyTNcZICnnKjeoAuL0L_lhhE4mgv5a8TsulaDJDg8M,2218
 pymoo/util/ref_dirs/misc.py,sha256=NsjLerUPMKyTm1EhccBn8dL59JpEflh8jfG039H5DD0,3198
 pymoo/util/ref_dirs/optimizer.py,sha256=xSOAZBKDijT4gM9ns8Uf6D9uVN1bvKZ-_kLWmI371bY,1501
 pymoo/util/ref_dirs/performance.py,sha256=rQSjkXmH-F_lrciK7ugm8dSuzf1WKNqMupDwEDE6r_s,3975
@@ -307,8 +309,8 @@ pymoo/visualization/video/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJW
 pymoo/visualization/video/callback_video.py,sha256=HWcaOy5b3cwGjotS_SJ0e5n3zpLZnjvs45o9GUkIgCI,2525
 pymoo/visualization/video/one_var_one_obj.py,sha256=RoanobBbC5g9zao7WIRH4832w2HQUgVpKcAS3F2zNVA,1917
 pymoo/visualization/video/two_var_one_obj.py,sha256=LN3P_IA36_L72iVFsghX1W_AzbENozrNN-EVzjCCXG0,2189
-pymoo-0.6.1.1.dist-info/LICENSE,sha256=LYHqBgglAG_I8_4oql3A_-uA-vMlthLJVSKRV7jBDcA,10765
-pymoo-0.6.1.1.dist-info/METADATA,sha256=Lx7k66Jp9Uf0BxarzRWZQM65QbEbDFDo_PU9YCscjQA,5091
-pymoo-0.6.1.1.dist-info/WHEEL,sha256=kuTeDis5C91zYs0QG8UUz0GexmuJbmDhtJ5x6uY9yRs,115
-pymoo-0.6.1.1.dist-info/top_level.txt,sha256=AQwRb60Qa58G1fn7bUhX8djnZycKvhJP2y8PCaA26Cg,6
-pymoo-0.6.1.1.dist-info/RECORD,,
+pymoo-0.6.1.2.dist-info/LICENSE,sha256=LYHqBgglAG_I8_4oql3A_-uA-vMlthLJVSKRV7jBDcA,10765
+pymoo-0.6.1.2.dist-info/METADATA,sha256=oScW_jwFq4f_MwJMOkXGF98uiMkE3k88hwZ33kxRRxM,5042
+pymoo-0.6.1.2.dist-info/WHEEL,sha256=eupBwbXGAhwNAPJSvj5BiShZwdZO8jnQ5yHfv-9aUGw,115
+pymoo-0.6.1.2.dist-info/top_level.txt,sha256=AQwRb60Qa58G1fn7bUhX8djnZycKvhJP2y8PCaA26Cg,6
+pymoo-0.6.1.2.dist-info/RECORD,,

{pymoo-0.6.1.1.dist-info → pymoo-0.6.1.2.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: bdist_wheel (0.41.3)
+Generator: bdist_wheel (0.43.0)
 Root-Is-Purelib: false
 Tag: cp311-cp311-macosx_10_9_universal2