Originally posted by: PhilippeLaborie
Hello,
In general, the equivalent of C++ ILOG CP goals are C++ ILOG CP Optimizer goals and there are no search goals in Java.
This being said, it depends what you want to do. Adding constraints in the model as you mention may be a possibility if your goal does not need to backtrack (otherwise, you will need to handle the reversibility yourself) and if you are working with a rather small model (otherwise, you may have performance issues). You may also consider using:
- Starting points (if your goal is supposed to try to extract some information from an existing, possibly infeasible, schedule)
- Search phases (if your goal is trying to structure the search by first trying to schedule a subset of activities, then another subset, etc...)
- Conflict refiner (if your goal is trying to identify a small infeasible subset of the global problem)
Philippe
#CPOptimizer#DecisionOptimization