Information Technology Reference
In-Depth Information
floating variable CtFloatVar
boolean variable CtBoolVar
Memory Management // memory management
new:
delete:
Constraints // constraint
CtTell(x == (y + z) );
Basic constraints: =,¡Ü,¡Ý,<>,+, -,*,/,subset, superset, union,
intersection, member, boolean or, boolean and, boolean not,
boolean xor,
CtTell((x ==0) | | (y ==0));
CtIfThen (x < 100, x = x+1) ;
Search // search
CTGOALn: how to execute CTGOAL1(CtInstantiate, CtIntVar*
x)
{
CtInt a = x->chooseValue() ;
CtOr(Constraint(x == a),
CtAnd(Constraint(x ! =a),
CtInstantiate(x) ));
}
Schedule // schedule
CtSchedule class
Global object: time original ···tineMin
time horizon ···timeMax
Resources // resource
CtResource
CtDiscreteResource
CtUnaryResource
CtDiscreteEnergy
CtStateResource
Activities // operation
CtActivity class
CtIntervalActivity
Activity is defined as the start time, end time, time span, operation requiring,
providing, consuming and resource production.
Constraint planning has already drawn the high attention of experts of each field,
because it is able to solve very difficult problem in reality. No matter we use the
advanced genetic algorithm, or use the simulation method of human-computer
interaction, we need further study on complex constraint of the manufacturing
Search WWH ::




Custom Search