I tried to write a problem myself by referring to TSP as it is easier to understand, but don't get what this function is for.

To me distance/cost is fixed to TSP problem, only variables for permutation to change as solution to evaluate the by 2 object, this update function is called for what reason and when?

jmetalsp-problem\src\main\java\org\uma\jmetalsp\problem\tsp\DynamicMultiobjectiveTSP.java

@OverRide
public void update(Observable<ObservedValue> observable, ObservedValue data) {
if (data!=null && data.getValue().getMatrixIdentifier() == "COST") {
updateCostValue(data.getValue().getX(),data.getValue().getY(),data.getValue().getValue());
} else if(data!=null && data.getValue().getMatrixIdentifier() == "VALUE"){
updateDistanceValue(data.getValue().getX(),data.getValue().getY(),data.getValue().getValue());
}
}

As title says, I want to update the problem based on iteration, such as changing it every 10 turns. Instead of according by delay time in streamDataSource.

hi, i am using the dynamic version of nsga-ii and i dont know how to generate the Pareto fronts. The structure i am using is similar to the example shown in DynamicTSP. Could somebody help me?

Dear jMetalSP commiters,

as optimization with large dataset usually takes long time, your streaming idea to add new data is brilliant to me. but my problem to resolve involves 2 kinds of data which is difficult to put into one class. as titles, any way to have more than one streaming datasource?

Buenas, necesito almacenar los frente de pareto de mi problema. A modo de guía he usado la clase DynamicTSPApplication para implementar la misma funcionalidad para mi problema pero en lugar de generar los ficheros solo genera el directorio donde se deberían de almacenar.

Me gustaría saber que está sucediendo para poder arreglarlo dado que a la hora de ejecutar el programa no lanza ningún fallo.
Gracias de antemano.

Hi, when I ran DynamicTSPApplicationSparkKafka.java with nyData.txt, only a single point at origin showed as Pareto front in every iteration, and I am curious about why this situation occurred.

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?

Hi, I am trying to disable the graphical part of the DynamicTSPApplication but i find no way to do it, could someone help me a bit?

I tried to write a problem myself by referring to TSP as it is easier to understand, but don't get this line.

To me nonConnectedLinks is just the number of violations to constraint(non connected city are set next to each other), why add "-numberOfCities+9"?

jmetalsp-problem\src\main\java\org\uma\jmetalsp\problem\tsp\DynamicMultiobjectiveTSP.java

numberOfViolatedConstraints.setAttribute(solution,nonConnectedLinks-numberOfCities+9);