v1.2.0: code and samples

Author: cordisvictor

LICENSE

@@ -1,2 +1,20 @@
-# easycsp-lib
+## EasyCSP is an open-source Java library for Constraint Satisfaction Programming.
+
 EasyCSP is an open-source Java library for Constraint Satisfaction Programming.
+
+EasyCSP offers search algorithms for both CSPs and CSOPs.
+
+EasyCSP supports CSPs to be formalized using objects or int expressions.
+
+
+### Dependencies
+
+ Requires Java 8 or later.
+
+### Release Notes
+
+!Release 1.2.0
+- fix: IntDomain size() bug when containing both positive and negative ints.
+- feature: added int specific model classes, constraint expressions API and
+specialized search algorithm.
+

README.md

@@ -0,0 +1,81 @@
+/*
+ * Copyright 2011 Victor Cordis
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ * Please contact the author ( [email protected] ) if you need additional
+ * information or have any questions.
+ */
+package net.sourceforge.easycsp.sample.jobscheduling;
+
+import net.sourceforge.easycsp.*;
+import net.sourceforge.easycsp.Algorithm.Fitness;
+import net.sourceforge.easycsp.alg.BranchAndBound;
+
+public class FlowtimeMain {
+
+    /**
+     * FlowtimeMain.main method solves the formal JobScheduling CSOP( Z, D , C):
+     * 5 Machines and 5 Jobs (for assigning more than one Job per Machine, the
+     * domain must contain arrays of Jobs)
+     */
+    public static void main(String[] args) {
+        // create CSP(Z,D,C):
+        Machine[] machines = new Machine[]{
+                new Machine(0, 3),
+                new Machine(1, 12),
+                new Machine(2, 8),
+                new Machine(3, 6),
+                new Machine(4, 7)
+        };
+        Domain<Job> domain = new ObjectDomain<>(new Job(0, 3), new Job(1, 6), new Job(2, 5), new Job(3, 10), new Job(4, 9));
+
+        EasyCSP flowtime = EasyCSPBuilder.of("Flowtime", domain, machines)
+                .constrainEachTwo(Constraints.notEqual())
+                .build();
+
+        Fitness<Machine, Job> estimation = (s, idx, score) -> {
+            if (idx == 0) {
+                double totalEstim = s.value(0).getOperationCount() / s.variable(0).get().getExecutionSpeed();
+                for (int i = 1; i < s.size(); i++) {
+                    // estimate the best case: the job with smallest OperationCount / Machine ExecutionSpeed:
+                    Variable<Machine, Job> v = s.variable(i);
+                    totalEstim += v.getDomain().get(0).getOperationCount() / v.get().getExecutionSpeed();
+                }
+                return totalEstim;
+            } else {
+                Variable<Machine, Job> v = s.variable(idx);
+                // undo last estimation:
+                double time = score - (v.getDomain().get(0).getOperationCount() / v.get().getExecutionSpeed());
+                // add the last element:
+                return time + (s.value(idx).getOperationCount() / v.get().getExecutionSpeed());
+            }
+        };
+        Fitness<Machine, Job> evaluation = (s, idx, score) ->
+        {
+            Variable<Machine, Job> v = s.variable(idx);
+            // undo last estimation:
+            double time = score - (v.getDomain().get(0).getOperationCount() / v.get().getExecutionSpeed());
+            // add the last element:
+            return time + (s.value(idx).getOperationCount() / v.get().getExecutionSpeed());
+        };
+
+        // solve:
+        BranchAndBound alg = BranchAndBound.minimizationOf(flowtime, estimation, evaluation);
+        Solver solver = new Solver(alg);
+        while (solver.solve()) {
+            System.out.println(solver.getSolutionCount() + " " + solver.currentSolution() + ", Flowtime= " + alg.evaluation());
+        }
+        System.out.println(solver.getSolutionCount() + " optimal solution(s) in " + solver.getElapsedTime() / 1000.00 + " seconds");
+    }
+}

easycsp/src-samples/.idea/misc.xml

@@ -0,0 +1,54 @@
+/*
+ * Copyright 2011 Victor Cordis
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ * Please contact the author ( [email protected] ) if you need additional
+ * information or have any questions.
+ */
+package net.sourceforge.easycsp.sample.jobscheduling;
+
+public class Job {
+
+    private int id;
+    private int operationCount;
+
+
+    public Job(int id, int operationcount){
+        this.id            = id;
+        this.operationCount= operationcount;
+    }
+
+    public int getId(){
+        return this.id;
+    }
+
+    public int getOperationCount(){
+        return this.operationCount;
+    }
+
+    @Override
+    public boolean equals(Object o){
+        if( o instanceof Job){
+            Job j=(Job) o;
+            return this.id == j.id;
+        }
+        return false;
+    }
+
+    @Override
+    public String toString(){
+        return "J(" + this.id + "," + this.operationCount + ")";
+    }
+
+}//class Job.