Package solver.search.strategy.strategy

Examples of solver.search.strategy.strategy.AbstractStrategy

155
156
157
158
159
160
161
162
163
      public void onSolution() {
        prettyOut();
      }
    });
    /* Heuristic choices */
    AbstractStrategy strat = IntStrategyFactory.minDom_LB(next);
    solver.set(IntStrategyFactory.lastConflict(solver,strat));
//    solver.set(strat);
  }
View Full Code Here
111
112
113
114
115
116
117
118
119
        solver.post(IntConstraintFactory.knapsack(objects, scalar, power, volumes, energies));
    }

    @Override
    public void configureSearch() {
        AbstractStrategy strat = IntStrategyFactory.lexico_LB(objects);
        // trick : top-down maximization
        solver.set(new ObjectiveStrategy(power, OptimizationPolicy.TOP_DOWN), strat);
    }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
        IntVar[] variables = new IntVar[n];
        for (int i = 0; i < n; i++) {
            variables[i] = VariableFactory.enumerated("V" + i, i, n + i, s);
        }
        AbstractStrategy asg = IntStrategyFactory.lexico_LB(variables);

        s.set(asg);

        env.worldPush();
        Decision decision = asg.getDecision();
        for (int i = 0; i < n; i++) {
            decision.buildNext();
            try {
                decision.apply();
            } catch (ContradictionException e) {
                e.printStackTrace();
            }
            Assert.assertTrue(variables[i].isInstantiated());
            Assert.assertEquals(variables[i].getValue(), i);
            Decision tmp = decision;
            decision = asg.getDecision();
            if (decision != null) {
                decision.setPrevious(tmp);
            } else {
                decision = tmp;
            }
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
        for (int i = 0; i < n; i++) {
            variables[i] = VariableFactory.enumerated("V" + i, i, n + i, s);
            asgs[i] = IntStrategyFactory.lexico_LB(variables[i]);
        }

        AbstractStrategy sts = ISF.sequencer(asgs);

        s.set(sts);

        env.worldPush();
        Decision decision = sts.getDecision();
        for (int i = 0; i < n; i++) {
            decision.buildNext();
            try {
                decision.apply();
            } catch (ContradictionException e) {
                e.printStackTrace();
            }
            Assert.assertTrue(variables[i].isInstantiated());
            Assert.assertEquals(variables[i].getValue(), i);
            Decision tmp = decision;
            decision = sts.getDecision();
            if (decision != null) {
                decision.setPrevious(tmp);
            } else {
                decision = tmp;
            }
View Full Code Here
185
186
187
188
189
190
191
192
        IntVar[] x = VariableFactory.enumeratedArray("x", 5, 1, 6, solver);
        SetVar y = VariableFactory.set("y", 1, 10, solver);
        solver.post(ICF.alldifferent(x));
        solver.post(SetConstraintsFactory.member(x[0], y));
        solver.findSolution();
        AbstractStrategy strat = solver.getStrategy();
        Assert.assertTrue(strat instanceof StrategiesSequencer);
    }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
        Constraint[] lcstrs = new Constraint[3];
        lcstrs[0] = IntConstraintFactory.arithm(vars[0], "<", vars[1]);
        lcstrs[1] = IntConstraintFactory.arithm(vars[1], "<", vars[2]);
        lcstrs[2] = IntConstraintFactory.arithm(vars[0], "!=", vars[1]);
        // configure Solver
        AbstractStrategy strategy = IntStrategyFactory.lexico_LB(vars);
        s.post(lcstrs);
        s.set(strategy);
        // solve
        s.findSolution();
        long sol = s.getMeasures().getSolutionCount();
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
                s.post(IntConstraintFactory.arithm(diag2[i], "=", vars[i], "+", i));
            }
            s.post(IntConstraintFactory.alldifferent(diag1, "BC"));
            s.post(IntConstraintFactory.alldifferent(diag2, "BC"));
        }
        AbstractStrategy strategy = IntStrategyFactory.lexico_LB(vars);
        s.set(strategy);
        s.findAllSolutions();
        long sol = s.getMeasures().getSolutionCount();
        Assert.assertEquals(sol, nbSol, "nb sol incorrect");
    }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
        Constraint[] cstrs = {
                IntConstraintFactory.arithm(Y, "!=", 4)
        };

        AbstractStrategy strategy = IntStrategyFactory.lexico_LB(vars);

        s.post(cstrs);
        s.set(strategy);
        s.findAllSolutions();
        Assert.assertEquals(s.getMeasures().getSolutionCount(), 2);
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
        Constraint[] cstrs = {
                IntConstraintFactory.arithm(Y, "!=", -2)
        };

        AbstractStrategy strategy = IntStrategyFactory.lexico_LB(vars);

        s.post(cstrs);
        s.set(strategy);
        s.findAllSolutions();
        Assert.assertEquals(s.getMeasures().getSolutionCount(), 4);
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
        Constraint[] cstrs = {
                IntConstraintFactory.arithm(Y, ">=", low + coeff - 1),
                IntConstraintFactory.arithm(Y, "<=", upp - coeff - 1)
        };

        AbstractStrategy strategy = IntStrategyFactory.lexico_LB(vars);

        s.post(cstrs);
        s.set(strategy);
        return s;
    }
View Full Code Here
TOP

Related Classes of solver.search.strategy.strategy.AbstractStrategy

  • choco.AllDifferentTest
  • choco.explanations.SimpleExplanationTest
  • choco.strategy.StrategyTest
  • samples.integer.Knapsack
  • samples.integer.MarioKart
  • solver.variables.OffsetViewTest
  • solver.variables.ScaleViewTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.