Can I use Platypus to solve Discrete MOFLPs? Also, does this NSGA-II work with constraints as well?

[MelinaRentzi]

Hello, I've been searching for a framework to solve a discrete multi-objective facility location problem, and I found your framework. As I understand, you have implemented some of the most popular testing problems for continuous optimization. Would I be able to use this framework to solve a discrete multiobjective facility location problem? I was thinking about using your NSGA-II algorithm and create my own custom MO function. Does your NSGA-II algorithm support constraints? If no, would I be able to create my own in the framework? Thanks a lot.

[mariocastrogama]

As I recall Platypus is built homologous to MOEA Framework. The list of algorithms are similar to the ones presented in the following link http://moeaframework.org/javadoc/overview-summary.html#listOfAlgorithms

1. Not sure what Facility Location Problem means, but Platypus supports Discrete variables (use Binary)
2. Does NSGA2 support constraints --> Yes

[MelinaRentzi]

Hello and thanks for the answer. Binary should work, I need one of my variables to be 0 or 1.

[github-actions[bot]]

This issue is stale and will be closed soon. If you feel this issue is still relevant, please comment to keep it active. Please also consider working on a fix and submitting a PR.