Pareto Front Sort for Python • Hacker News Board

Re: Pareto Front Sort for Python

#11

Post by phijFTW » Mon, Jun 29, 2020, 9:16 AM UTC

Generally, I would also recommend using pymoo [1] if you have multi-objective optimization problems. They also have an implementation of Non-dominated Sorting [2], which should serve the same purpose.

[1]: https://pymoo.org/

[2]: https://github.com/msu-coinlab/pymoo/blob/master/pymoo/util/...

Re: Pareto Front Sort for Python

#12

Post by anonymoushn » Mon, Jun 29, 2020, 10:46 AM UTC

kummappp wrote: post #2

I did not find pareto front sorting library so I made one. It took a weekend. Save your weekend and use my module instead.

In the first example, why does (None, 0, 1) dominate (0, 0, 0)? The latter has a higher value in the first position.

Re: Pareto Front Sort for Python

#13

Post by kummappp » Sat, Jul 11, 2020, 4:39 PM UTC

anonymoushn wrote: post #12

kummappp wrote: post #2

I did not find pareto front sorting library so I made one. It took a weekend. Save your weekend and use my module instead.

In the first example, why does (None, 0, 1) dominate (0, 0, 0)? The latter has a higher value in the first position.

Oh, it is a bug. I'll fix it. How embarrassing and thanks. I have mainly used the None means the whole row is inferior -thing.

Re: Pareto Front Sort for Python

#14

Post by kummappp » Sat, Jul 11, 2020, 4:41 PM UTC

phijFTW wrote: post #11

Generally, I would also recommend using pymoo [1] if you have multi-objective optimization problems. They also have an implementation of Non-dominated Sorting [2], which should serve the same purpose. [1]: https://pymoo.org/ [2]: https://github.com/msu-coinlab/pymoo/blob/master/pymoo/util/...

Thanks. The 'Non-dominated sorting' was the magic phrase for google i was missing.