Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Is fast_best_order_sort intended to be usable by NonDominatedSorting? #563

Open
JonathanRaynerMonumo opened this issue Feb 8, 2024 · 1 comment
Assignees

Comments

@JonathanRaynerMonumo
Copy link

JonathanRaynerMonumo commented Feb 8, 2024

#495 has some benchmarks that seem to show good speed for fast_best_order_sort from the cython code, but it doesn't seem to be importable here.

@blankjul
Copy link
Collaborator

I can't recall if there was a reason to make it not accessable. Maybe I wanted to wait until my co-workers paper was officially available.

Please see my commit above and give it a test if this works now.

import numpy as np

from pymoo.util.nds.non_dominated_sorting import NonDominatedSorting

np.random.seed(1)
F = np.random.random(size=(100, 2))

nds = NonDominatedSorting(method='fast_best_order_sort')

res = nds.do(F)
print(res)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants