Hi everyone,
I am trying to use Gecode to solve a multi-criterion problem
minimize (F1(x,z), F2(x,z) )
subject to constraints on x,z
The objectives are ordered in order of importance, so I would like to first
solve the problem P1
minimize F1(x,z)
subject to original constraints on x,z
and then consider the modified problem P2
minimize F2(x,z)
subject to original constraints on x,z
F1(x,z) = F1opt
where F1opt is the optimal value of P1.
What is the most efficient way to implement this in Gecode?
I am now doing two completely separate searches, in the sense that I create
a new Space and run BAB on it for each of the problems. I am sure that this
cannot be the most efficient way of dealing with the problem, but am unable
to figure out how to do it "the right way". Essentially, when solving P2 I
should be able to make use of the work done while solving P1...
Any feedback is very much appreciated!
Thanks,
JC
_______________________________________________
Gecode users mailing list
users@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
