Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import JaCoP.core.*;
- import JaCoP.constraints.*;
- import JaCoP.search.*;
- import JaCoP.constraints.binpacking.*;
- import java.io.*;
- /**
- * The class Run is used to run test programs for JaCoP package.
- * It is used for test purpose only.
- *
- * @author Krzysztof Kuchcinski
- * @version 3.0
- */
- public class Ex {
- Store store;
- IntVar vars;
- IntVar Cost;
- int CostValue;
- static boolean bbSearch = true;
- public static void main (String args) {
- int position = 0;
- if (args.length() >= 1)
- if (args.equals("-bb")) {
- position++;
- bbSearch = true;
- }
- else if (args.equals("-restart")) {
- position++;
- bbSearch = false;
- }
- Ex run = new Ex();
- run.example();
- }
- // Ex() {}
- void example() {
- store = new Store();
- int[] w = {10,10,10,10,9,9,8,9,1,1,1,1,1};
- IntVar b[] = new IntVar[15];
- for (int i = 0; i < w.length; i++) {
- b[i] = new IntVar(store, "b"+i, 0, 10);
- }
- int bins = 8;
- IntVar c[] = new IntVar[15];
- for (int i = 0; i < bins; i++) {
- c[i] = new IntVar(store, "c"+i, 10, 10);
- }
- Constraint binPacking = new Binpacking(b, c, w);
- store.impose( binPacking );
- boolean Result = store.consistency();
- System.out.println (binPacking);
- System.out.println( "\nIntVar store size: "+ store.size()+"\nNumber of constraints: " + store.numberConstraints() );
- Search<IntVar> label = new DepthFirstSearch<IntVar>();
- SelectChoicePoint<IntVar> select = new SimpleSelect<IntVar>(b, null, new IndomainMin<IntVar>());
- label.setAssignSolution(true);
- label.setPrintInfo(true);
- Result = label.labeling(store, select);
- if (Result) {
- System.out.println("*** Yes");
- System.out.println (java.util.Arrays.asList(b));
- System.out.println (java.util.Arrays.asList(c));
- }
- else
- System.out.println("*** No");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement