Choco Solver ICF 约束定义数组中最小和最大变量之间的距离

Choco Solver ICF constraint to define the distance between min and max variable in an array

我有一组 Choco 求解器 IntVar 变量,比如 X1、X2、...、Xn。我需要定义一个强制执行规则的约束 - 最小和最大变量之间的距离(绝对差)值应小于固定值,例如 100,即 |max(X1,..Xn) - min(X1, ..,Xn)| < 100 。

有人可以帮忙吗?

你有 IntConstraintFactory.distance() 方法来精确地做到这一点。参见 docs

下面是执行您要求的实际代码:

Solver solver = new Solver();

int n = 10;
IntVar[] x = VariableFactory.boundedArray("x", n, 0, 500, solver);

IntVar min = VariableFactory.bounded("min", 0, 500, solver);
IntVar max = VariableFactory.bounded("max", 0, 500, solver);

solver.post(IntConstraintFactory.minimum(min, x));
solver.post(IntConstraintFactory.maximum(max, x));

solver.post(IntConstraintFactory.distance(min, max, "<", 100));

if (solver.findSolution()) {
    int solutions = 5;
    int nSol = 0;
    do {
        System.out.print("x: ");
        for (int i = 0; i < n; i++)
            System.out.print(x[i].getValue() + " ");
        System.out.println("\nmin = " + min.getValue() + ", max = " + max.getValue() + ", |min - max| = " + Math.abs(min.getValue() - max.getValue()) + "\n");

        nSol++;

        if (solutions > 0 && nSol >= solutions)
            break;
    } while (solver.nextSolution());

    System.out.println(nSol + " solutions found.");
} else {
    System.out.println("No solution found.");
}