Package solver

Examples of solver.Solver

150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
//        NSCPModelConstrained.ConstraintOptions patternOptions = NSCPModelConstrained.ConstraintOptions.WITH_MCRW;
//        NSCPModelConstrained.ConstraintOptions patternOptions = NSCPModelConstrained.ConstraintOptions.WITH_REG;
        NSCPModelConstrained.ConstraintOptions patternOptions = NSCPModelConstrained.ConstraintOptions.WITH_MCR;
        BranchingStrategy strategy = BranchingStrategy.FORCE_DOMWDEG;

        Solver solver = new Solver();
        NurseSchedulingProblem m = new NSCPModelConstrained(data, basisOptions, patternOptions, solver);
        IntVar[] vars = ArrayUtils.flatten(ArrayUtils.transpose(m.getShifts()));

        solver.set(strategy.getGoal(solver, vars));

        System.out.printf("%s\n", solver.toString());
        if (Boolean.TRUE == solver.findSolution()) {
            NSChecker checker = new NSChecker(data);
            if (checker.checkSolution(m.getSolution(solver)))
                System.out.println("Solution checked.");
        }
    }
View Full Code Here
70
71
72
73
74
75
76
    int[][] optfreq, matrix, options, idleConfs;


    @Override
    public void createSolver() {
        solver = new Solver("CarSequencing");
    }
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
    }


    public static void runOne(NSData data, BranchingStrategy strategy, NSCPModelConstrained.ConstraintOptions basisOptions, NSCPModelConstrained.ConstraintOptions patternOptions) {
        System.out.println(strategy.name() + "\t " + patternOptions.name() + "\t " + basisOptions.name());
        Solver solver = new Solver();
        NurseSchedulingProblem m = new NSCPModelConstrained(data, basisOptions, patternOptions, solver);
        SearchMonitorFactory.limitTime(solver, 180000);
        IntVar[] vars = ArrayUtils.flatten(ArrayUtils.transpose(m.getShifts()));
        solver.set(strategy.getGoal(solver, vars));
        String solved = "0";
        if (Boolean.TRUE == solver.findSolution()) {
            m.printSolution(solver);
            NSChecker checker = new NSChecker(data);
            if (checker.checkSolution(m.getSolution(solver)))
                System.out.println("Solution checked.");
            solved = "1";
        }
        String content =
                solved + ",\t" + solver.getMeasures().getTimeCount() + " ms,\t "
                        + solver.getMeasures().getNodeCount() + " nodes,\t "
                        + solver.getMeasures().getBackTrackCount() + " bks,\t "
                        + strategy.name() + "\t " + patternOptions.name() + "\t " + basisOptions.name() + "\t "
                        + m.getDescription() + "\n";
        String contentCSV =
                solved + "," + solver.getMeasures().getTimeCount() + ","
                        + solver.getMeasures().getNodeCount() + ","
                        + solver.getMeasures().getBackTrackCount() + ","
                        + strategy.name() + "," + patternOptions.name() + "," + basisOptions.name() + ","
                        + m.getDescription() + "\n";
        System.out.println(content);
        BufferedWriter writer = null;
        try {
View Full Code Here
47
48
49
50
51
52
53
    int n = 4;
    int vals = n + 1;

    @Override
    public void createSolver() {
        solver = new Solver();
    }
View Full Code Here
79
80
81
82
83
84
85
    BoolVar[][][] P, M;

    @Override
    public void createSolver() {
        solver = new Solver("Social golfer " + g + "-" + w + "-" + s);
    }
View Full Code Here
48
49
50
51
52
53
54
    int n = 4;
    int vals = n - 1;

    @Override
    public void createSolver() {
        solver = new Solver();
    }
View Full Code Here
48
49
50
51
52
53
54
    int n = 10;
    IntVar[] vars;

    @Override
    public void createSolver() {
        solver = new Solver("Pigeons");
    }
View Full Code Here
48
49
50
51
52
53
54
    int n = 4;
    int vals = n - 1;

    @Override
    public void createSolver() {
        solver = new Solver();
    }
View Full Code Here
58
59
60
61
62
63
64
  // METHODS
  //***********************************************************************************

  @Override
  public void createSolver() {
    solver = new Solver("Cumulative example: makespan minimisation");
  }
View Full Code Here
56
57
58
59
60
61
62
    private final int n = 9;
    IntVar[][] rows, cols, carres;

    @Override
    public void createSolver() {
        solver = new Solver("Sudoku");
    }
View Full Code Here
TOP

Related Classes of solver.Solver

  • choco.AllDifferentTest
  • choco.checker.consistency.ConsistencyChecker
  • choco.checker.correctness.CorrectnessChecker
  • choco.checker.fmk.Correctness
  • choco.ClauseTest
  • choco.explanations.ExplanationTest
  • choco.IntLinCombTest
  • choco.LimitsTest
  • choco.LogicTreeTest
  • choco.NotEqualX_YCTest
    • 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.