pymoo 0.6.1__cp311-cp311-win_amd64.whl → 0.6.1.2__cp311-cp311-win_amd64.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"
+__version__ = "0.6.1.2"

{pymoo-0.6.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
+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.dist-info → pymoo-0.6.1.2.dist-info}/RECORD

@@ -2,7 +2,7 @@ pymoo/__init__.py,sha256=k4UAJinBluYML1fOx-lQQ44-T957ZA4ChW39zsMkD1o,43
 pymoo/config.py,sha256=75-7sANvZrupa8HMa4oy-ffrTx1MVeQplUFw4CZ06mI,942
 pymoo/docs.py,sha256=UDp1fdlf2FGXhaHsy7zNeTGQXwtuHnpTCinPxlK8Oa0,8853
 pymoo/optimize.py,sha256=Ba-uPGK5mGTiFpFNspoK9mAZ1_phTA5_84xPmVSs3Xk,2410
-pymoo/version.py,sha256=y9FpASAjf8iz4OKPpaT2zC8cn_jVhPizicSeVZ3n0ZE,23
+pymoo/version.py,sha256=uuNh2B2CkovTwN11bijXbJPfqmEwv22wDAdOFymLx6k,25
 pymoo/algorithms/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 pymoo/algorithms/hyperparameters.py,sha256=J1Ueq5BhwKSMPUHTOsSC5YY8lOuuRDXdHHwtUnPoSp8,2593
 pymoo/algorithms/base/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -12,35 +12,35 @@ pymoo/algorithms/base/line.py,sha256=MSu3gD6gnymSpaLs-_vo12jjH0rbTmwRvVMYtBmUruw
 pymoo/algorithms/base/local.py,sha256=4CVtB69qsAgNAzujQTfRjLjVZeKdxSfN7wuZk6Qd0xI,1555
 pymoo/algorithms/base/meta.py,sha256=Lv4Mr_glxWAypycAcZZECUyD2o3aAdezTf2JWYMFKXk,1983
 pymoo/algorithms/moo/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pymoo/algorithms/moo/age.py,sha256=EmL67VtEbRxJ_UI75n11NBnbyJ4IwA-lgaqcP3eG6uw,10839
+pymoo/algorithms/moo/age.py,sha256=Da50lU5E50N00MOWkMjJYJIx1zcFas3rXlGn3fCx1uo,10844
 pymoo/algorithms/moo/age2.py,sha256=mqG60dfO0ok3HQXHUVULclipdL06iACMxcCibJKR_Q8,5201
 pymoo/algorithms/moo/ctaea.py,sha256=CeiqpyGUzdE5Qt95yqxXLIEZp-ngpM1umJhC8Q7MQFI,12442
 pymoo/algorithms/moo/dnsga2.py,sha256=-zopb3rU7Bsu3rrKe-GA4Mfu2mm8DaxgtBcNKUjDiZg,2954
 pymoo/algorithms/moo/kgb.py,sha256=rnDD51oQjmjbUMWvyoCkB_u7Rd5hVJYqe6-SJWZwJW8,16740
 pymoo/algorithms/moo/moead.py,sha256=n2JajN6RFB1xh-uJRRT2-TWkBTlAbxzmew1CqixVL2g,7490
 pymoo/algorithms/moo/nsga2.py,sha256=C7aIAYyArXCb5W4dByjioWZANyuF2V8i3oTAu4gM8Fo,4539
-pymoo/algorithms/moo/nsga3.py,sha256=o6lPQ8IbSN26v_-F1-1NCHA_j20WedKlVTvkENJ5XZo,13699
+pymoo/algorithms/moo/nsga3.py,sha256=JqOU8xCjawXORyMeBZhOO9sDVXVFx5FM7sX19ECLrWk,13697
 pymoo/algorithms/moo/rnsga2.py,sha256=JZFMgNlrnSe7M5z_hmj2KoqpxIdmo8ZvcUpj9cE5HZc,7338
 pymoo/algorithms/moo/rnsga3.py,sha256=TXOz6BYQ9NbPp-4nH2w9cSkuCWTDubsrsGAWgkr8YGs,10157
 pymoo/algorithms/moo/rvea.py,sha256=aPIaXOSQY9kLHjoSFjpfshvjluo32erWqOJh64pdLec,8074
-pymoo/algorithms/moo/sms.py,sha256=yq-6D4PmgdCxpaJvCt_GGZzY9zfwXzTknrQE77p7jLA,7153
+pymoo/algorithms/moo/sms.py,sha256=1-KOQNUpN0Q7Osfh-tCwR-uZygijbrsdcBbFwE-LtZc,7185
 pymoo/algorithms/moo/spea2.py,sha256=Cug308XQ92JoMPZot8Tu6hx4kfMZYd2vqre03VlBPrI,7194
 pymoo/algorithms/moo/unsga3.py,sha256=0OW1phpAYVPJXRorhwL6jeRaHFtd3NBUHDEWImU1WR8,1675
 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=DYzED1NdTHODpoLz3N9ER0DOoqwzfSDoiwSlFDQBJ1Q,6580
-pymoo/algorithms/soo/nonconvex/cmaes.py,sha256=Z4_tS3Oef2KrTjnN8lg8FF2fl_7BYeC-haueyNzta4s,20264
+pymoo/algorithms/soo/nonconvex/cmaes.py,sha256=3SaAIQGIbVUpPL-X46dvCQZmr6vaaZ7CJU2oUCRU9T0,20284
 pymoo/algorithms/soo/nonconvex/de.py,sha256=0DFw6UmROQB2kPrr7g-vPxsy13nLjThUKxnUOXKZTRM,11012
 pymoo/algorithms/soo/nonconvex/direct.py,sha256=FmMGnoEDr4JVgT17kxEzQ_8hTHSkksgO147ff8KBuz8,5341
-pymoo/algorithms/soo/nonconvex/es.py,sha256=1ayKpaGSghjZFjMBCIkHDRcHWdIjaRirJ5thPOy4mdg,7440
+pymoo/algorithms/soo/nonconvex/es.py,sha256=TkCr2tqqQDs7BFv8DrZwgCEmpmNV9miOrsbeH9x0iog,7436
 pymoo/algorithms/soo/nonconvex/g3pcx.py,sha256=y0mSA30U9luxeEc8iunoxfNNoTNSkb5qMnJKx4k-w0s,3516
 pymoo/algorithms/soo/nonconvex/ga.py,sha256=fZs0QWisKLwCzyzp_ksfZZtzSrvWRHUy1bWi0UcZqjE,3569
 pymoo/algorithms/soo/nonconvex/ga_niching.py,sha256=JA1oCopF-T1NrblAnNhoACrcNh-Fepsu8dJAWAmyFYI,8858
 pymoo/algorithms/soo/nonconvex/isres.py,sha256=75LSmIKMm-463cKmjsqz9tjIEdFaJAeKChzG0K-9cH4,2678
 pymoo/algorithms/soo/nonconvex/nelder.py,sha256=cPG68KiwkBywCbq5NzNOGcLKpT9l19pJTIb1rBX-hh0,9308
-pymoo/algorithms/soo/nonconvex/optuna.py,sha256=MyrPqt02Z8M_WIxVO-zGZtVSi8z4a9VG2KUVOaV86PY,2682
-pymoo/algorithms/soo/nonconvex/pattern.py,sha256=X50SLO-xervMh3duvqQ3l6K6vPeDwNFoAmuCLTHx0II,6811
+pymoo/algorithms/soo/nonconvex/optuna.py,sha256=YmIoxK8MVqh5GBwsxcEEKGA1hqoBZ_6uUe1bGxKJpMo,2666
+pymoo/algorithms/soo/nonconvex/pattern.py,sha256=zPHxBC_picCDhufRCGOGodGsxQdfxc-zG-I_rAu2_3E,6802
 pymoo/algorithms/soo/nonconvex/pso.py,sha256=GwgtNKUmqABtrHUZb0tHxtisGFbHFgpuSbtl_S0vipk,13798
 pymoo/algorithms/soo/nonconvex/pso_ep.py,sha256=9Y4ygkFlHQ5VrGox81GCEFHAH1i1ziBRMX5LrdCYUKo,10620
 pymoo/algorithms/soo/nonconvex/random_search.py,sha256=iiLde96TBbNAHCVQO6Bmpl_fGM97JqYa7YyfNtdHcoI,907
@@ -52,13 +52,13 @@ pymoo/algorithms/soo/univariate/golden.py,sha256=w0GypUz6e1cVs6yWNKGq9Zisr80IHm1
 pymoo/algorithms/soo/univariate/quadr_interp.py,sha256=4hlrHqtX5GVZQQEHyWtQR4ZEZHIb6iNcseEvL5nWjoA,2366
 pymoo/algorithms/soo/univariate/wolfe.py,sha256=GpCA1GHkJwmFRTGQRS_ROFmqUeKQOQ3uM04ALZGiv9I,5784
 pymoo/constraints/__init__.py,sha256=rqUtJyMLicobcyhmr74TepjmUQAEmlazKT3vjV_n3aA,6
-pymoo/constraints/adaptive.py,sha256=MLofSDLI4d50FRx0c0TyxKLvBuhArxDNvHGU7Pa_ZdI,1956
+pymoo/constraints/adaptive.py,sha256=QzkBndq0IzUGYCVa7Mj-cWqVaig8p5eaXD5VY0_53J0,1996
 pymoo/constraints/as_obj.py,sha256=cuyRgzZ-hK-5L4Mc0WYi4xbbv4XtiYpyrggb8wYcRBE,1589
 pymoo/constraints/as_penalty.py,sha256=_z7sH4keOpi-QuYmaVeKonBcwRMfZzze5rIaVWTACHc,1222
-pymoo/constraints/eps.py,sha256=eQW4H8gFczmInUk57kTgF1qJxNlQ69tnRN_kYMBKg48,815
+pymoo/constraints/eps.py,sha256=d2YeWtIGcetfCsra020WzsaD3cQD0DInhKqsks3nQyo,835
 pymoo/constraints/from_bounds.py,sha256=PmiCYzNufUW8P8UCXmEpK55hM5D0paPLQ9OOk4898Mo,1053
 pymoo/core/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pymoo/core/algorithm.py,sha256=Ry8khfjJT5TMOUn0jLuPmRfEyTRNBA89WZyYbdND5JQ,12537
+pymoo/core/algorithm.py,sha256=ki9dg_aljWrTHPDwnZ0Q0K2EMSDg7qQjeGO4srf6tWQ,12567
 pymoo/core/callback.py,sha256=LYnIucOVfkkrURKkn4optoPFDt1Yz2gy-kumbBEC2W4,844
 pymoo/core/crossover.py,sha256=3fSo7lZRGbfqP9OZYh0L80PNoapjYaXZWD63QDJLNro,2790
 pymoo/core/decision_making.py,sha256=OYE0QA3Fde3eLwhstl28FLBlnamDE7DR6a9mY7Ecxk0,3074
@@ -66,7 +66,7 @@ pymoo/core/decomposition.py,sha256=bZnZ9Gc_vK_l-IM8OEu49CV_q0GkSJ_uJvk8jxE0FZ8,2
 pymoo/core/duplicate.py,sha256=r9UI-dEeAsW1Emg0_0_Exa21DwrTifyL3zEbrVON-7k,4169
 pymoo/core/evaluator.py,sha256=c09KUL2wwRFI9jYtKin5AVIwj8iiSQ3mUees4feaRJk,4273
 pymoo/core/indicator.py,sha256=LkQqPJetQIMrwOFaHQ5xGhwjB76sG8Asjs7eXsuasLY,916
-pymoo/core/individual.py,sha256=FSbS3xbX4S1KaGq26kOI0avpUTuR0VB9zXjLWkS0Ly4,7416
+pymoo/core/individual.py,sha256=TsBupw1yHVj5ERCHXuTg-nBs9uimG_JtSr2kyqBgb-A,21161
 pymoo/core/infill.py,sha256=dBBZC8p6O3AY4EmfMZuKcjHAsHjWig__Ir2X0h8ZuoE,2390
 pymoo/core/initialization.py,sha256=hWBFHzkLx9HHJnp9WbkuEDpgkL6RGdt1GCtdPnnvxBs,1501
 pymoo/core/mating.py,sha256=7DizqpuT9bWUNWR3o843Az3m2VF_6-HiqyalU80RaC8,1279
@@ -75,28 +75,28 @@ pymoo/core/mixed.py,sha256=hz8ScnmakJkrYB4R4wtb_LLtI3YiTOILhXOs-TzZ0Ug,5934
 pymoo/core/mutation.py,sha256=h3mgBVJzw6QceSm7XY1NCHEAqIPTahYMmaKlY3HxTGA,1344
 pymoo/core/operator.py,sha256=n7ZUTattsj1hG3h0sM4ekVwKJ5iy2zABZ0VdkBiyV5A,977
 pymoo/core/parameters.py,sha256=y6OhZGJPY0PbxSsplCcOuvBDdWNpH45vAQx0ifiv-UE,3331
-pymoo/core/plot.py,sha256=_ZGvpAw930e_KmYEcWksYip9BoP_le6cn3IlA_bXb-g,6324
+pymoo/core/plot.py,sha256=rBLDZI1u5FmXbFDG9q1lZkoEtqfJYEq_Jlw0CVYgU3E,6328
 pymoo/core/population.py,sha256=ccmf_TXPdUNzJSRk4_J0RGZ4KW0WXwmVvkWA6QvkK8I,5046
 pymoo/core/problem.py,sha256=ftjO6rpwogVIpxi11zvefZEhF4Y66PD-KtaHViBNMbI,14466
 pymoo/core/recorder.py,sha256=olPHYSYWNl_jrIPPB9_SNNSRmHvj7FAD31WE0yxGo5I,2493
 pymoo/core/repair.py,sha256=FVflxWURPKotiJGHPUO4F7-QK4hlM8gdW-D0rqusEuo,454
 pymoo/core/replacement.py,sha256=XY3_QJsdNaCy4qGt8qflSZlOgxzjZosNi-mh6b_9Sx4,2897
-pymoo/core/result.py,sha256=xT-SyP-OtzrEx5NvSMZNipG4rfl_9LDVKsVLpIhMy04,1201
+pymoo/core/result.py,sha256=X9tV1XdC1BzJQeGca6EzoJuh3aXYJlJQlniS1a8hc6Y,1273
 pymoo/core/sampling.py,sha256=2flQm_4XayCcPVLXt9QTxfG5qjMSWzt5JJvc5Jt7X94,1101
 pymoo/core/selection.py,sha256=mwltF3nFGAkS4SufnOZMpZb68zmbyWJGTtI2tD7KaG0,1902
 pymoo/core/solution.py,sha256=-UmEmzO62zImVuAd8bDeokHMWfX7xcv631ntXF_Is8U,181
 pymoo/core/survival.py,sha256=vDhy51jPjv0V7lrWZZ1IDhqI06NOUqlsEISBMS9EeLg,3176
 pymoo/core/termination.py,sha256=ehj-gWKLX0FT4YzofpHYTYyQUBblJC-6pXB76J2CR0Y,1785
-pymoo/core/variable.py,sha256=4qWj0brhoCbGgUq8pCMCU85qIgDir8O2ulLuusEBa1I,2306
+pymoo/core/variable.py,sha256=ZMeybeksqvSgrbvpOUHCftB1PZiesALxT_kYkOrY_LY,11109
 pymoo/cython/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pymoo/cython/calc_perpendicular_distance.cp311-win_amd64.pyd,sha256=bbN_lEZJxhYHQ9sc79fqK-7Tb8rfkBXhKSTpvA8z-Q4,152064
-pymoo/cython/decomposition.cp311-win_amd64.pyd,sha256=8WIdhTsAW6--uZqR-d3LK4cN5V8DQcyDgaShSgoaLDA,169984
-pymoo/cython/hv.cp311-win_amd64.pyd,sha256=CVrm7qDtyNF-bPhsH4tbL0CwEPTpMjLgTDH7fjLQLJo,151040
-pymoo/cython/info.cp311-win_amd64.pyd,sha256=l5ffBS-y98zsKtn6DX3VhoFysiu5lR0KaRR_vBKLNsM,29184
-pymoo/cython/mnn.cp311-win_amd64.pyd,sha256=ZgxhE4X6XKYw7Eb0dVsZMMtpFSn0atTzCCR2L95urxM,185856
-pymoo/cython/non_dominated_sorting.cp311-win_amd64.pyd,sha256=NnkYScQr3sRQYvDCVEEvGW8Ers5eWZ5B9MPCZOPGiI8,202752
-pymoo/cython/pruning_cd.cp311-win_amd64.pyd,sha256=XLS9qspl_49HKlUoHtui8dWRy6gPgfGLTs8xPNuaslk,178176
-pymoo/cython/stochastic_ranking.cp311-win_amd64.pyd,sha256=Q7LrONuvAAQUVBSxIc3jkJLD-nCZWpSQrOksOU8FHl4,153600
+pymoo/cython/calc_perpendicular_distance.cp311-win_amd64.pyd,sha256=DGH9cIGjNFp5_ZNS388jwjLvk1LpkxrSFioE2cwmlpU,152576
+pymoo/cython/decomposition.cp311-win_amd64.pyd,sha256=4Hed1rC-g1EPZgc0DM-xKmD0WGdDngqgwLx69Ro7krc,171008
+pymoo/cython/hv.cp311-win_amd64.pyd,sha256=6g2fEe5Dj9jTJ8shGRuLgNYe_EQgfpG2UgS1tNrBsfs,151552
+pymoo/cython/info.cp311-win_amd64.pyd,sha256=7YRskHw0-xfz-9XevBGo5RZM3ylTJ9ixTLvebJa2F1Q,29184
+pymoo/cython/mnn.cp311-win_amd64.pyd,sha256=7jW4VkXc4fxTp1IANugjPwdI8fco_GGGNdzvvSahSLo,187392
+pymoo/cython/non_dominated_sorting.cp311-win_amd64.pyd,sha256=sKB-gf4UNVyCOSgHlcLlUQRO3o276QZvxHPMh3x40Kg,225792
+pymoo/cython/pruning_cd.cp311-win_amd64.pyd,sha256=OVwMTjbm89s0LBDOpLA9phbIFUq6YkgaB9KlnrST538,178176
+pymoo/cython/stochastic_ranking.cp311-win_amd64.pyd,sha256=LKZZiPGrCCTKSbdyaLPxZvX-9irKhdAJJk86ztsVXX0,154112
 pymoo/cython/utils.pxd,sha256=fPA2Kqkgguw65imTWchitlxMI911J5GkM93rVjCWN2o,2681
 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=2rjbyrjFyb_8rqAPF9DXI_3aMRyXd3aH0VKQ3
 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=sDglIcVRRS6Fqj8pRUzoqmhPkgrH8LGpXfAMu02qMsQ,2116
-pymoo/gradient/__init__.py,sha256=-9NpaCjRXF93-C8SoMK_upzXmUt6O8Mg822syPSn-6Q,347
+pymoo/gradient/__init__.py,sha256=cXSRlssyvl4mL5g7KzTQHTav5I2bTyd66V3co35UNOE,342
 pymoo/gradient/automatic.py,sha256=_ZVyKB1QXmja1FYttHlS8ps1YZBvJk4sSv0aB86Or5k,1962
-pymoo/gradient/grad_autograd.py,sha256=rW6rlu8zV2FgunQBHrE47aTviJeCCR3hTzY0zC97fIg,2190
+pymoo/gradient/grad_autograd.py,sha256=z5j1-heiByWnbsldVDCOGEbFe2WnPJmIaZjtyELgtqI,2701
 pymoo/gradient/grad_complex.py,sha256=6x5MuQWP4q7fzy3KJqOm-xTgWE7G8H3X_I5WJdKy0Bk,1046
 pymoo/gradient/grad_jax.py,sha256=27dOMjr6x1bupn6OW_EY9TdH4_TqPiOLihAmSk2UnbY,1166
 pymoo/gradient/toolbox/__init__.py,sha256=UT_TY-IXId93F84nWNsVgi_0LcRnExrOuD0gRey5uXQ,128
@@ -147,7 +147,7 @@ pymoo/operators/crossover/nox.py,sha256=nmHiUCAYMGM7g9HZsxYwfRRnchElrT96ljI3yYv1
 pymoo/operators/crossover/ox.py,sha256=iT91UpQ4tIm_SijW19Z_rDahFihtzmRR9IqQFFrd-K8,2604
 pymoo/operators/crossover/pcx.py,sha256=3Cy0yftOrnCTNdv0Fxw-RXRi11XdlfvJohwW3jTpPDk,2719
 pymoo/operators/crossover/pntx.py,sha256=B0Y0c4QHMox1VUSZJ8Ygr7RGwqp24tw9Dnbe2St7-AA,1310
-pymoo/operators/crossover/sbx.py,sha256=nXmkS9nomCIaxxbmbvfkzSaTQ9aHmV7IZggkVMMX70M,4243
+pymoo/operators/crossover/sbx.py,sha256=YjDUlLVb2yOioHN6XoymO8pn-quW6IxPTdSzW8odT8I,4243
 pymoo/operators/crossover/spx.py,sha256=8iuXWsKTq69lI-EDSFQqbLwBOpFguJMqS3ltqU04T1c,113
 pymoo/operators/crossover/ux.py,sha256=L3H6MtQoJ9tqdHfZ3wCFjzDhfO63R-J4ePVb8lByWrE,459
 pymoo/operators/mutation/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -245,7 +245,7 @@ pymoo/util/archive.py,sha256=i7bNEHaX7ZakbfYn_-6gjOy67TWE7sieCaHOlznrnhY,4490
 pymoo/util/cache.py,sha256=m_cV66-SS21syDmI6Wqrks5MLyIURmPeYBFO04Uhi1Y,847
 pymoo/util/clearing.py,sha256=g6rWld8Jut3xb8ZvmWbcm2PkSQHY-WIrsFgATUro15w,1826
 pymoo/util/dominator.py,sha256=THDYsQoQdblWnMS5T6vUAlhs398KzwY-wAAMxMviKGI,1873
-pymoo/util/function_loader.py,sha256=DEUOvhGo_tI3QGY1r-dArN3K9rm3uYqxysOX5Rk6quo,4084
+pymoo/util/function_loader.py,sha256=YHNIYwYvCnvmDcrtAFBFD3h0nK3QpDLUy-b4AnLmcoM,4528
 pymoo/util/hv.py,sha256=r0_j8wfDyrTNe-vrF3mk94sbuNiV6jen80rvehri-zg,441
 pymoo/util/matlab_engine.py,sha256=C12y81qn92kzCQiEcSGkNXb_pRTNBdh7ol9h9Cb57Ps,1279
 pymoo/util/misc.py,sha256=do1txSQ9UKmml8Lf6YRMV64i13bxeb7mdt1JG8glwlE,11587
@@ -268,19 +268,21 @@ pymoo/util/display/display.py,sha256=-XoGC-kilO4E6hWFTesMl5Iu2RDSuc8YX-7vBIKIbYY
 pymoo/util/display/multi.py,sha256=Ufy7eXrgggtxMREyRkxjcS-VR_ztTBpOXR6Jf0WQq34,3051
 pymoo/util/display/output.py,sha256=6hXCT_BcL_1Awj5ivz8ykLL1I4XgdS-LVXmFaiO2xTo,1435
 pymoo/util/display/progress.py,sha256=b3tyiAzKFKdKN3IiPBrKUXXln8oluCHC2bQWEQlZd1U,1301
-pymoo/util/display/single.py,sha256=VzmaHrQj4TgabDzNPpVSVp-8o225w8zQQFogIprak2M,1830
+pymoo/util/display/single.py,sha256=Sz8lbwDRyvfpX93onqJPzyWROwXoavYNy_pXs_JiMe0,1840
 pymoo/util/nds/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pymoo/util/nds/dominance_degree_non_dominated_sort.py,sha256=MIAB-jpX9U5WoTE2T8b5akn03RRUXpwMrq6OVnsB0Uw,5308
 pymoo/util/nds/efficient_non_dominated_sort.py,sha256=V9zV1gtaKzGpgpcQGkD-iExI2ACNlDzAlk6y96GpoGI,4088
 pymoo/util/nds/fast_non_dominated_sort.py,sha256=fj1j39CCCSx5TsP2_XpgWRJ_1SLoBEk7Yg9tQZxwRNE,1749
 pymoo/util/nds/naive_non_dominated_sort.py,sha256=lTJjjBSZ7ojE6qMmud3OB2ns1GzfKyFguo91mSkW_kA,858
 pymoo/util/nds/non_dominated_sorting.py,sha256=DcSimTEn-e1JweKrByqHm4vMAD5-jD5NIDoxAJcYyvU,1994
 pymoo/util/nds/tree_based_non_dominated_sort.py,sha256=e0iefd-Wu7ctefd8Z76l8F2XxCiIi_dOiYchf1atpRc,3763
-pymoo/util/ref_dirs/__init__.py,sha256=OC_BMAYaxDN6zvvRyt6f0TTFOyl8seFeEzzwrEEiD-U,995
+pymoo/util/ref_dirs/__init__.py,sha256=M0SghufgZ7Ku04n_EjgUq6XWpKMQP0iziHb3bvP7ETs,1139
 pymoo/util/ref_dirs/construction.py,sha256=JlA8Xyowu3AyLc_JX_qwPBcVXw33eub_r29TKHLd4sg,2817
 pymoo/util/ref_dirs/das_dennis.py,sha256=4SBmBCqVSO5uQ6QDOG_Htu2tBeHDnqV18B2mDib8LK8,1552
-pymoo/util/ref_dirs/energy.py,sha256=SMSe-rS4639z8rJVAFNlhBWKGEuyF37JIb9gExWoj2o,11868
-pymoo/util/ref_dirs/energy_layer.py,sha256=xxz5YuZVL5n8QslAx7ff2fKBSThoOKJ8TaI7Q2QPVX8,3647
+pymoo/util/ref_dirs/energy.py,sha256=-X5yBpnOs9MPYPX7tQT8uO1qboLCemdsEV4wh34S-xc,11882
+pymoo/util/ref_dirs/energy_layer.py,sha256=DJR6iaIh5hP6xl-AxwSB9cWYbAbm5XG43AFMykubDC8,3658
 pymoo/util/ref_dirs/genetic_algorithm.py,sha256=Pepw8BvoWgt_5SacsSnIYsovs56NIwzV5QPV9i4F8N0,1991
+pymoo/util/ref_dirs/incremental.py,sha256=T0AlzXJxliNcD2PNN7xfsPziOpxgGbuH6uRLnPhkbE0,2286
 pymoo/util/ref_dirs/misc.py,sha256=ecbQmE1CTV2IhpBaffIH6klUAwaJU09xaQSwgs0yEkY,3326
 pymoo/util/ref_dirs/optimizer.py,sha256=03HerdH71QFTurJct1g8sTrfV409Wf5lrfoLOLHAx4A,1560
 pymoo/util/ref_dirs/performance.py,sha256=S7jweHGdF-Qcb-YmY-_pMgWXK-1gborroNqwoSlufno,4137
@@ -307,8 +309,8 @@ pymoo/visualization/video/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJW
 pymoo/visualization/video/callback_video.py,sha256=6h7ZYWH7Egls15vi01XxpCjAugSwgrgZzkHT9L0_uaY,2607
 pymoo/visualization/video/one_var_one_obj.py,sha256=e3YOpcwShnwaaJidI9yJ-94auPHBiC0wGGq5u5vGIXs,1974
 pymoo/visualization/video/two_var_one_obj.py,sha256=sZcnpaNbamEH8MrDdxvygDGuN-L04yMHdrDeP9e6ObE,2251
-pymoo-0.6.1.dist-info/LICENSE,sha256=c3wLHEScsIpcWMZmUKxiP6AQRnOybZKvZg71K8xefyc,10956
-pymoo-0.6.1.dist-info/METADATA,sha256=KP07nIFtQOF0nKgRxpWXaikTmG20Hg7sLn59GBBt3BQ,5278
-pymoo-0.6.1.dist-info/WHEEL,sha256=82gZYSdmJ63dmEqVXfVfYjP-6F3ar13SybIjiy8AOec,102
-pymoo-0.6.1.dist-info/top_level.txt,sha256=AQwRb60Qa58G1fn7bUhX8djnZycKvhJP2y8PCaA26Cg,6
-pymoo-0.6.1.dist-info/RECORD,,
+pymoo-0.6.1.2.dist-info/LICENSE,sha256=c3wLHEScsIpcWMZmUKxiP6AQRnOybZKvZg71K8xefyc,10956
+pymoo-0.6.1.2.dist-info/METADATA,sha256=Bruowq6EF0Fm0-hOA6Jvd0uNKaIMJK6QJb_0MhjbPSs,5230
+pymoo-0.6.1.2.dist-info/WHEEL,sha256=nSybvzWlmdJnHiUQSY-d7V1ycwEVUTqXiTvr2eshg44,102
+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.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-win_amd64