You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The objectives of the problem are supposed to be maximized with the value of 4 being the theoretical best (though it may not be the ideal point of the objective). A slide explaining the problem is shown below.
As the provided ideal and nadir values are positive, I don't think you have converted the problem into minimization. If that is the case, ideal should be larger than the nadir. I do not know if there are any other issues with the implemented objectives/constants/constraints as I do not know the actual problem implementation. Please check the implementation and make sure that it is alright.
The text was updated successfully, but these errors were encountered:
I simply swapped the ideal and nadir values and changed the objective to maximization and the implementation "seems" correct now.
Here's what the Pareto front of the problem is supposed to look like:
Here's what it looks like with the modified problem:
The shapes are similar-ish, so that's good. But the currently implemented EAs are very bad at handling constraints (and this problem has a huge number of those). So this may entirely be an issue for the EAs now, rather than a wrongly implemented problem.
But just in case, check the implementation. I will leave this issue open.
Thanks for noticing this! I had indeed the ideal and nadir values the wrong way (they should be swapped) and the argument maximize for the objectives should be set to True. I double checked the the problem definition, and it should be correct now (fixed in commit 2c0fbc6).
The implementation follows a matlab file that was forwarded to be by the creators of the original problem. To me, our front looks better, but it is also true that there is a huge number of constraints. I also notices small numerical differences between the results of the matlab implementation and the DESDEO2 implementation in Python, which might be due to floating point arithmetics (we have quadratic and log terms, which propagate even small errors very quickly...).
I have forwarded to you some email correspondences detailing the issue. This is good enough for now.
DESDEO/desdeo/problem/testproblems.py
Line 2290 in bdd73a1
The objectives of the problem are supposed to be maximized with the value of 4 being the theoretical best (though it may not be the ideal point of the objective). A slide explaining the problem is shown below.
As the provided ideal and nadir values are positive, I don't think you have converted the problem into minimization. If that is the case, ideal should be larger than the nadir. I do not know if there are any other issues with the implemented objectives/constants/constraints as I do not know the actual problem implementation. Please check the implementation and make sure that it is alright.
The text was updated successfully, but these errors were encountered: