How to use jMetalSP to solve a nurse shift scheduling problem?

[bronzels]

Dear jMetalSP commiters,

i am trying to solve a problem very much similar to a problem described here and provided or-tools solution.
https://developers.google.com/optimization/scheduling/employee_scheduling

but bool variables of my own problem is huge and can't be solved by ortools. And I found jMetalSP that claims to use spark, so i wanna give a try on jMetalSP. But there are only examples for ZDT, FDA, TSP, and even TSP is closest to my problem, still no enough clues from TSP examples for me to make my own Problem like DynamicMultiobjectiveTSP.

can you pls take a look at the google example and tell how to implement it in jMetalSP?

btw, i read the introduction of jMetal(https://jmetal.github.io/jMetal/), it seems that only algorithms for multiple objects can be in parallel, so single object in parallel is not possible and N/A for spark in jMetalSP? If single object can speedup by spark, how to achieve single objective optimization in jMetalSP, by only set one objective is enough or not?

[cbarba]

You can implement the Employee Scheduling Problem the same way that the TSP problem, but you only must implement the interface DynamicProblem only if your problem can change its data during the running time. We use Spark for processing the objective function, so you can use it for solving mono-objective or multi-objective problems