cp_set_schedule_strategy
cp_set_schedule_strategy |
Purpose
The cp_schedule search algorithm is decomposed in two distinct phases. The first phase target the finding of an near optimal heuristic solution quiclly. The second and last phase focuses on improving the bound and prove optimality.
Synopsis
procedure cp_set_schedule_strategy(phase:integer, arrayBranching:array(range) of cpbranching)
procedure cp_set_schedule_strategy(phase:integer, branching:cpbranching)
Arguments
|
phase
|
algorithm phase
KALIS_INITIAL_SOLUTION,
KALIS_OPTIMAL_SOLUTION
|
|
branching
|
the search strategy
|
|
arrayBranching
|
the search strategies
|
Example
The following example shows how to set the search stragey for the cp_schedule function
cp_set_schedule_strategy(KALIS_INITIAL_SOLUTION,
assign_var(KALIS_SMALLEST_MIN,KALIS_MIN_TO_MAX))
Related topics