Package solver

Examples of solver.Solver.post()

75
76
77
78
79
80
81
82
83
84
85
        solver.post(precedence(windows, 1, painting, solver));
        solver.post(precedence(roofing, 1, facade, solver));
        solver.post(precedence(plumbing, 8, facade, solver));
        solver.post(precedence(roofing, 1, garden, solver));
        solver.post(precedence(plumbing, 8, garden, solver));
        solver.post(precedence(facade, 2, objective, solver));
        solver.post(precedence(garden, 1, objective, solver));
        solver.post(precedence(painting, 2, objective, solver));

        solver.set(IntStrategyFactory.minDom_LB(new IntVar[]{masonry, carpentry, plumbing, ceiling,
        roofing, painting, windows, facade, garden, objective}));
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
        solver.post(precedence(roofing, 1, facade, solver));
        solver.post(precedence(plumbing, 8, facade, solver));
        solver.post(precedence(roofing, 1, garden, solver));
        solver.post(precedence(plumbing, 8, garden, solver));
        solver.post(precedence(facade, 2, objective, solver));
        solver.post(precedence(garden, 1, objective, solver));
        solver.post(precedence(painting, 2, objective, solver));

        solver.set(IntStrategyFactory.minDom_LB(new IntVar[]{masonry, carpentry, plumbing, ceiling,
        roofing, painting, windows, facade, garden, objective}));
        return solver;
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
        solver.post(precedence(plumbing, 8, facade, solver));
        solver.post(precedence(roofing, 1, garden, solver));
        solver.post(precedence(plumbing, 8, garden, solver));
        solver.post(precedence(facade, 2, objective, solver));
        solver.post(precedence(garden, 1, objective, solver));
        solver.post(precedence(painting, 2, objective, solver));

        solver.set(IntStrategyFactory.minDom_LB(new IntVar[]{masonry, carpentry, plumbing, ceiling,
        roofing, painting, windows, facade, garden, objective}));
        return solver;
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
        for (i = 0; i < n - 1; i++) {
            cstrs[i] = IntConstraintFactory.arithm(vars[i], "<", vars[i + 1]);
        }
        cstrs[i] = IntConstraintFactory.arithm(vars[n - 1], "<", vars[0]);

        s.post(cstrs);
        s.set(IntStrategyFactory.lexico_LB(vars));
        return s;
    }

View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
      if(l.isEmpty())throw new UnsupportedOperationException();
      if(enumerated){
        succ[i] = VF.enumerated("suc",l.toArray(),solver);
      }else{
        succ[i] = VF.bounded("suc",offset,n+offset,solver);
        solver.post(ICF.member(succ[i],l.toArray()));
      }
    }
    succ[n-1] = VF.fixed(n+offset,solver);
    solver.post(ICF.path(succ,VF.fixed(offset,solver),VF.fixed(n-1+offset,solver),offset));
    // configure solver
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
        succ[i] = VF.bounded("suc",offset,n+offset,solver);
        solver.post(ICF.member(succ[i],l.toArray()));
      }
    }
    succ[n-1] = VF.fixed(n+offset,solver);
    solver.post(ICF.path(succ,VF.fixed(offset,solver),VF.fixed(n-1+offset,solver),offset));
    // configure solver
    if (rd) {
      if(enumerated){
        solver.set(ISF.random_value(succ,seed));
      }else{
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
        Solver solver = new Solver("my first problem");
        // 2. Create variables through the variable factory
        IntVar x = VariableFactory.bounded("X", 0, 5, solver);
        IntVar y = VariableFactory.bounded("Y", 0, 5, solver);
        // 3. Create and post constraints by using constraint factories
        solver.post(IntConstraintFactory.arithm(x, "+", y, "<", 5));
        // 4. Define the search strategy
        solver.set(IntStrategyFactory.lexico_LB(new IntVar[]{x, y}));
        // 5. Launch the resolution process
        solver.findSolution();
    }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
        RealConstraint rc = new RealConstraint(
                "my fct",
                "({0}*{1})+sin({0})=1.0;ln({0}+[-0.1,0.1])>=2.6",
                Ibex.HC4,
                x, y);
        solver.post(rc);
        SMF.log(solver, true, false);
        solver.findSolution();
    }
}
View Full Code Here
530
531
532
533
534
535
536
537
538
539
540
    @Test(groups = "1s")
    public void testregular() {
        Solver solver = new Solver();
        IntVar[] CS = VF.enumeratedArray("CS", 4, 1, 5, solver);
        solver.post(ICF.regular(CS,
                new FiniteAutomaton("(1|2)(3*)(4|5)")));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }

View Full Code Here
542
543
544
545
546
547
548
549
550
551
552
    public void testscalar() {
        Solver solver = new Solver();
        IntVar[] CS = VF.enumeratedArray("CS", 4, 1, 4, solver);
        int[] coeffs = new int[]{1, 2, 3, 4};
        IntVar R = VF.bounded("R", 0, 20, solver);
        solver.post(ICF.scalar(CS, coeffs, R));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }

    @Test(groups = "1s")
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.