(self)
return not np.array_equal(current, self.front.value)
Calculate the non-dominated set of points based on the latest data.

        The stored Pareto set is sorted on the first objective in ascending order.

        :return: boolean, whether the Pareto set has actually changed since the last iteration
Calculate the non-dominated set of points based on the latest data.
Calculate the non - dominated set of points based on the latest data .
def _update_front(self):
        """
        Calculate the non-dominated set of points based on the latest data.

        The stored Pareto set is sorted on the first objective in ascending order.

        :return: boolean, whether the Pareto set has actually changed since the last iteration
        """
        current = self.front.value
        pf, _ = non_dominated_sort(self.Y)

        self.front = pf[pf[:, 0].argsort(), :]

        return not np.array_equal(current, self.front.value)
def _update_front ( self ) : current = self . front . value pf , _ = non_dominated_sort ( self . Y ) self . front = pf [ pf [ : , 0 ] . argsort ( ) , : ] return not np . array_equal ( current , self . front . value )