org.chocosolver.examples.integer.OpenStacks Maven / Gradle / Ivy
/*
* This file is part of examples, http://choco-solver.org/
*
* Copyright (c) 2022, IMT Atlantique. All rights reserved.
*
* Licensed under the BSD 4-clause license.
*
* See LICENSE file in the project root for full license information.
*/
package org.chocosolver.examples.integer;
import org.chocosolver.examples.AbstractProblem;
import org.chocosolver.solver.Model;
import org.chocosolver.solver.variables.BoolVar;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.util.ESat;
import org.kohsuke.args4j.Option;
import static org.chocosolver.solver.constraints.nary.cnf.LogOp.and;
import static org.chocosolver.solver.constraints.nary.cnf.LogOp.ifOnlyIf;
/**
*
*
* @author Charles Prud'homme
* @since 17/03/12
*/
public class OpenStacks extends AbstractProblem {
@Option(name = "-d", aliases = "--data", usage = "Open stacks instance.", required = false)
Data data = Data.V_small;
int nc; // nb of customers
int np; // nb of products
int[][] orders; // which customer orders which product
int[] norders; // nb of orders per customer
IntVar[] scheds; // schedule of products
IntVar[][] o; // orders fill after time t
BoolVar[][] o2b;
IntVar[] open; // schedule of products
IntVar objective;
public void setUp() {
int k = 0;
nc = data.data[k++];
np = data.data[k++];
orders = new int[nc][np];
norders = new int[nc];
for (int j = 0; j < nc; j++) {
int s = 0;
for (int i = 0; i < np; i++) {
orders[j][i] = data.data[k++];
s += orders[j][i];
}
norders[j] = s;
}
}
@Override
public void buildModel() {
model = new Model();
setUp();
scheds = model.intVarArray("s", np, 0, np - 1, false);
model.allDifferent(scheds, "BC").post();
o = new IntVar[nc][np + 1];
for (int i = 0; i < nc; i++) {
o[i] = model.intVarArray("o_" + i, np + 1, 0, norders[i], false);
// no order at t = 0
model.arithm(o[i][0], "=", 0).post();
}
for (int t = 1; t < np + 1; t++) {
for (int i = 0; i < nc; i++) {
// o[i,t] = o[i,t-1] + orders[i,s[t]] );
IntVar value = model.intVar("val_" + t + "_" + i, 0, norders[i], false);
model.element(value, orders[i], scheds[t - 1], 0).post();
model.sum(new IntVar[]{o[i][t - 1], value}, "=", o[i][t]).post();
}
}
o2b = model.boolVarMatrix("b", np, nc);
for (int i = 0; i < nc; i++) {
for (int j = 1; j < np + 1; j++) {
BoolVar[] btmp = model.boolVarArray("bT_" + i + "_" + j, 2);
model.ifThenElse(btmp[0],
model.arithm(o[i][j - 1], "<", model.intVar(norders[i])),
model.arithm(o[i][j - 1], ">=", model.intVar(norders[i])));
model.ifThenElse(btmp[1],
model.arithm(o[i][j], ">", model.intVar(0)),
model.arithm(o[i][j], "<=", model.intVar(0)));
model.addClauses(ifOnlyIf(o2b[j - 1][i], and(btmp[0], btmp[1])));
}
}
open = model.intVarArray("open", np, 0, nc + 1, true);
for (int i = 0; i < np; i++) {
model.sum(o2b[i], "=", open[i]).post();
}
objective = model.intVar("OBJ", 0, nc * np, true);
model.max(objective, open).post();
}
@Override
public void configureSearch() {
}
@Override
public void solve() {
model.getSolver().limitNode(200000);
model.setObjective(false, objective);
while (model.getSolver().solve()) {
prettyOut();
}
}
private void prettyOut() {
StringBuilder st = new StringBuilder("Open stacks problem\n");
st.append("\t");
for (int i = 0; i < nc; i++) {
for (int j = 0; j < np; j++) {
st.append(orders[i][j]).append(" ");
}
st.append("(").append(norders[i]).append(")\n\t");
}
st.append("\n\t");
if (model.getSolver().isFeasible() == ESat.TRUE) {
for (int j = 0; j < np; j++) {
st.append(scheds[j].getValue()).append(" ");
}
st.append("\n\n\t");
for (int j = 0; j < np; j++) {
for (int i = 0; i < nc; i++) {
st.append(o2b[j][i].getValue()).append(" ");
}
st.append(" ").append(open[j].getValue()).append("\n\t");
}
st.append("\n\t").append("OBJ:").append(objective.getValue());
} else {
st.append("INFEASIBLE");
}
//st.append(solver.toString());
System.out.println(st);
}
public static void main(String[] args) {
new OpenStacks().execute(args);
}
////////////////////////////////////////// DATA ////////////////////////////////////////////////////////////////////
enum Data {
V_small(new int[]{
5, 6, //nb customers= 5, nb products = 6,
// orders
0, 0, 1, 0, 1, 0,
0, 1, 0, 0, 0, 0,
1, 0, 1, 1, 0, 0,
1, 1, 0, 0, 0, 1,
0, 0, 0, 1, 1, 1
}),
small(new int[]{
7, 14,
// orders
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1,
1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1,
0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0,
0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0,
0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0,
0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0,
0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0,
0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0,
1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0,
}),
med(new int[]{
10, 20,
// orders
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1,
1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1,
0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0,
0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0,
0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0,
0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0,
0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0,
0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0,
1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0,
});
final int[] data;
Data(int[] data) {
this.data = data;
}
public int get(int i) {
return data[i];
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy