Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/**
* Copyright (c) 2015, Ecole des Mines de Nantes
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the .
* 4. Neither the name of the nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package org.chocosolver.samples.real;
import org.chocosolver.samples.AbstractProblem;
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.constraints.real.Ibex;
import org.chocosolver.solver.constraints.real.RealConstraint;
import org.chocosolver.solver.search.strategy.IntStrategyFactory;
import org.chocosolver.solver.trace.Chatterbox;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.solver.variables.RealVar;
import org.chocosolver.solver.variables.VariableFactory;
/**
* mozart-oz:
* "A kid goes into a grocery store and buys four items. The cashier
* charges $7.11, the kid pays and is about to leave when the cashier
* calls the kid back, and says ''Hold on, I multiplied the four items
* instead of adding them; I'll try again; Hah, with adding them the
* price still comes to $7.11''. What were the prices of the four items?
*
* The model is taken from: Christian Schulte, Gert Smolka, Finite Domain
* Constraint Programming in Oz. A Tutorial. 2001."
*
*
* This problem deals with large domains which result in integer overflows with classical constraints.
* Thus, this example introduces a dedicated propagator which handles large value products.
*
* @author Charles Prud'homme, Jean-Guillaume Fages
* @since 08/08/11
*/
public class Grocery extends AbstractProblem {
IntVar[] itemCost;
RealVar[] realitemCost;
@Override
public void createSolver() {
solver = new Solver("Grocery");
}
@Override
public void buildModel() {
double epsilon = 0.000001d;
// 4 integer variables (price in cents)
itemCost = VariableFactory.boundedArray("item", 4, 1, 711, solver);
// views as real variables to be used by Ibex
realitemCost = VariableFactory.real(itemCost, epsilon);
solver.post(new RealConstraint("Sum", "{0} + {1} + {2} + {3} = 711", Ibex.COMPO, realitemCost));
solver.post(new RealConstraint("Product", "{0} * {1}/100 * {2}/100 * {3}/100 = 711", Ibex.HC4, realitemCost));
// symmetry breaking
solver.post(new RealConstraint("SymmetryBreaking","{0} <= {1};{1} <= {2};{2} <= {3}", Ibex.HC4, realitemCost));
}
@Override
public void configureSearch() {
// choco branching
Chatterbox.showStatistics(solver);
Chatterbox.showSolutions(solver);
Chatterbox.showDecisions(solver);
solver.set(IntStrategyFactory.lexico_UB(itemCost));
// ibex branching
// solver.set(new AssignmentInterval(realitemCost, new Cyclic(realitemCost), new RealDomainMiddle()));
}
@Override
public void solve() {
solver.findSolution();
solver.getIbex().release();
}
@Override
public void prettyOut() {
System.out.println("*******");
int sum = 0;
long prod = 1;
for (int i = 0; i < 4; i++) {
sum += realitemCost[i].getUB();
prod *= itemCost[i].getValue();
System.out.println("item " + i + " : " + itemCost[i].getValue());
}
prod /= 1000000;
System.out.println("sum = " + sum + " instead of 711");
System.out.println("prod = " + prod + " instead of 711");
}
public static void main(String[] args) {
new Grocery().execute(args);
}
}
