-
hello,MOEA\D decomposes multiobjective optimization problem(MOP) into N subproblems and solves them simultaneously.And N subproblem is divided into S islands(equal to the number of ComputerCore).So i …
-
hi @dhadka,
Kindly give me your opinion about saving the solutions and their indicators.
I have looked at issues #158, #126, #51, #160 to get an understanding of how to deal with this subject,…
-
Hi,
I face a strange error time to time (it happens randomly) with nextDouble generation, which is the following:
```
java.lang.ArrayIndexOutOfBoundsException: 624
at org.apache.commons.math…
-
Hi @dhadka
I modified the code sample you gave me here #181, (see modified version below). When I run the code, the optimization runs fine but at the end when the runtime data should be written, I…
-
**Hi, I just wanted to know how to select the best results from the Playtpus code that I adapted from LINGO software. Because the Playtpus gives me a lot of good results. For example, I wanted ONLY ON…
-
I've realized that, depending on the number of variables, sometimes it does not find any valid solution, whereas I know it exists.
I've created the following simplified example in which the problem…
-
Hi,
I am trying to run a multi-objective optimization on my problem which looks like this:
---------------------------------------------------------------------------------------------------
clas…
-
The MOEAFramework throws an exception:
Exception in thread "main" java.lang.IllegalArgumentException: Comparison method violates its general contract!
at java.util.TimSort.mergeLo(TimSort.java:77…
-
I have some good guess about the final PF, is it possible to add them into the initial population or archives?
-
Hi. I am trying to adapt my problem from LINGO software to Playtpus language and I cannot run this code. Someone can help to tell me what was wrong? The code is:
And yep, the problem is single obje…