org.xcsp.modeler.problems.Rack2 Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of xcsp3-tools Show documentation

Java Tools for parsing XCSP3 instances, compiling JvCSP3 models, and checking solutions. For more information about XCSP3, follow www.xcsp.org

The newest version!

/**
 * AbsCon - Copyright (c) 2017, CRIL-CNRS - [email protected]
 * 
 * All rights reserved.
 * 
 * This program and the accompanying materials are made available under the terms of the CONTRAT DE LICENCE DE LOGICIEL LIBRE CeCILL which accompanies this
 * distribution, and is available at http://www.cecill.info
 */
package org.xcsp.modeler.problems;

import org.xcsp.common.IVar.Var;
import org.xcsp.modeler.api.ProblemAPI;

public class Rack2 implements ProblemAPI {
	int nRacks;
	RackModel[] rackModels;
	CardType[] cardTypes;

	class RackModel {
		int power, nConnectors, price;
	}

	class CardType {
		int power, demand;
	}

	@Override
	public void model() {
		rackModels = addObject(rackModels, new RackModel(), 0); // we add first a dummy model (0,0,0)
		int nModels = rackModels.length, nTypes = cardTypes.length;
		int[] powers = valuesFrom(rackModels, rackModel -> rackModel.power);
		int[] connectors = valuesFrom(rackModels, rackModel -> rackModel.nConnectors);
		int[] prices = valuesFrom(rackModels, rackModel -> rackModel.price);
		int[] cardPowers = valuesFrom(cardTypes, cardType -> cardType.power);
		int maxCapacity = maxOf(connectors);

		Var[] r = array("r", size(nRacks), dom(range(nModels)), "r[i] is the model used for the ith rack");
		Var[][] c = array("c", size(nRacks, nTypes), (i, j) -> dom(range(Math.min(maxCapacity, cardTypes[j].demand) + 1)),
				"c[i][j] is the number of cards of type j put in the ith rack");
		Var[] rpw = array("rpw", size(nRacks), dom(powers), "rpw[i] is the power of the ith rack");
		Var[] rcn = array("rcn", size(nRacks), dom(connectors), "rcn[i] is the number of connectors of the ith rack");
		Var[] rpr = array("rpr", size(nRacks), dom(prices), "rpr[i] is the price of the ith rack");

		forall(range(nRacks), i -> extension(vars(r[i], rpw[i]), indexing(powers))).note("linking the ith rack with its power");
		forall(range(nRacks), i -> extension(vars(r[i], rcn[i]), indexing(connectors))).note("linking the ith rack with its number of connectors");
		forall(range(nRacks), i -> extension(vars(r[i], rpr[i]), indexing(prices))).note("linking the ith rack with its price");

		forall(range(nRacks), i -> sum(c[i], LE, rcn[i])).note("connector-capacity constraints");
		forall(range(nRacks), i -> sum(c[i], weightedBy(cardPowers), LE, rpw[i])).note("power-capacity constraints");
		forall(range(nTypes), i -> sum(columnOf(c, i), EQ, cardTypes[i].demand)).note("demand constraints");

		block(() -> {
			decreasing(r);
			disjunction(ne(r[0], r[1]), ge(c[0][0], c[1][0]));
		}).tag(SYMMETRY_BREAKING);

		minimize(SUM, rpr);
	}
}