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.integer;
import gnu.trove.list.TIntList;
import gnu.trove.list.array.TIntArrayList;
import gnu.trove.set.hash.TIntHashSet;
import org.chocosolver.samples.AbstractProblem;
import org.chocosolver.solver.ResolutionPolicy;
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.constraints.IntConstraintFactory;
import org.chocosolver.solver.search.limits.FailCounter;
import org.chocosolver.solver.search.loop.monitors.SearchMonitorFactory;
import org.chocosolver.solver.search.strategy.IntStrategyFactory;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.solver.variables.VariableFactory;
import org.chocosolver.util.ESat;
import org.kohsuke.args4j.Option;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.*;
/**
* CELAR Radio Link Frequency Assignment Problem:
*
* "The Radio Link frequency Assignment Problem consists in assigning frequencies to a set of radio links
* defined between pairs of sites in order to avoid interferences.
* Each radio link is represented by a variable whose domain is the set of all frequences
* that are available for this link."
*
*
* Instances can be downloaded here.
* Once unzipped, the program argument "-d" should point out to one directory containing instance description.
* For instance "../FullRLFAP/CELAR/scen02".
*
* @author Charles Prud'homme
* @since 19/03/12
*/
public class RLFAP extends AbstractProblem {
private static String DOM = "dom.txt";
private static String VAR = "var.txt";
private static String CTR = "ctr.txt";
@Option(name = "-d", aliases = "--directory", usage = "RLFAP instance directory (see http://www.inra.fr/mia/T/schiex/Export/FullRLFAP.tgz).", required = true)
String dir;
@Option(name = "-o", aliases = "--optimize", usage = "Minimize the number of allocated frequencies", required = false)
boolean opt = false;
int[][] _dom, _ctr;
int[][] _var;
IntVar[] vars;
IntVar[] cards;
IntVar nb0;
int[] freqs;
int[] rank;
@Override
public void createSolver() {
solver = new Solver("RLFAP " + dir);
}
@Override
public void buildModel() {
_dom = readDOM(dir + File.separator + DOM);
_var = readVAR(dir + File.separator + VAR);
_ctr = readCTR(dir + File.separator + CTR);
TIntHashSet values = new TIntHashSet();
vars = new IntVar[_var.length];
vars = new IntVar[_var[_var.length - 1][0]];
int n = vars.length;
int prev = 0;
for (int i = 0; i < _var.length; i++) {
int vidx = _var[i][0] - 1;
if (vidx > prev) {
for (; prev < vidx; ) {
vars[prev++] = VariableFactory.fixed(0, solver);
}
}
int didx = _var[i][1];
if (_var[i].length > 2) {
vars[vidx] = VariableFactory.fixed(_var[i][2], solver);
} else {
vars[vidx] = VariableFactory.enumerated("v_" + vidx, _dom[didx], solver);
values.addAll(_dom[didx]);
}
prev = vidx + 1;
}
int[][] graph = new int[n][n];
for (int i = 0; i < _ctr.length; i++) {
int[] ci = _ctr[i];
solver.post(IntConstraintFactory.distance(vars[ci[0] - 1], vars[ci[1] - 1], (ci[2] == 0 ? "=" : ">"), ci[3]));
// MARK BOTH SPOTS IN "PRECEDENCE" GRAPH
graph[ci[0] - 1][ci[1] - 1] = 1;
graph[ci[1] - 1][ci[0] - 1] = 1;
}
if (opt) {
cards = VariableFactory.boundedArray("c", values.size(), 0, vars.length, solver);
freqs = values.toArray();
Arrays.sort(freqs);
for (int i = 0; i < freqs.length; i++) {
solver.post(IntConstraintFactory.count(freqs[i], vars, cards[i]));
}
nb0 = VariableFactory.bounded("nb0", 0, freqs.length, solver);
solver.post(IntConstraintFactory.count(0, cards, nb0));
}
// RANKING VARIABLES PER LAYER OF DISTINCT SPOT
rank = new int[n];
boolean[] treated = new boolean[n];
int i = 0;
Deque toTreat = new ArrayDeque<>();
toTreat.push(i);
rank[i] = 0;
while (!toTreat.isEmpty()) {
i = toTreat.pop();
treated[i] = true;
for (int j = 0; j < n; j++) {
if (graph[i][j] == 1) {
rank[j] = Math.max(rank[i] + 1, rank[j]);
if (!treated[j] && !toTreat.contains(j)) {
toTreat.push(j);
}
}
}
}
}
@Override
public void configureSearch() {
solver.set(IntStrategyFactory.domOverWDeg(vars, seed));
SearchMonitorFactory.luby(solver, 2, 2, new FailCounter(solver, 2), 25000);
}
@Override
public void solve() {
SearchMonitorFactory.limitNode(solver, 10000);
if (opt)
solver.findOptimalSolution(ResolutionPolicy.MAXIMIZE, nb0);
else
solver.findSolution();
}
@Override
public void prettyOut() {
System.out.println(String.format("RLFAP %s", dir));
StringBuilder st = new StringBuilder();
if (solver.isFeasible() == ESat.TRUE) {
st.append("\t");
for (int i = 0; i < vars.length; i++) {
st.append(vars[i].getValue()).append(" ");
if (i % 10 == 9) {
st.append("\n\t");
}
}
if (opt) {
st.append("\n\tnb assigned freq.:").append(freqs.length - nb0.getValue());
for (int i = 0; i < freqs.length; i++) {
st.append("\n\tF ").append(freqs[i]).append(" : ").append(cards[i].getValue());
}
}
} else {
st.append("\tINFEASIBLE");
}
System.out.println(st.toString());
}
public static void main(String[] args) {
new RLFAP().execute(args);
}
/////////////////////
protected int[][] readDOM(String filename) {
FileReader f;
String line;
TIntHashSet values = new TIntHashSet();
try {
f = new FileReader(filename);
BufferedReader r = new BufferedReader(f);
List domains = new ArrayList<>();
while ((line = r.readLine()) != null) {
Scanner sc = new Scanner(line);
sc.nextInt();
while (sc.hasNextInt()) {
values.add(sc.nextInt());
}
domains.add(values.toArray());
values.clear();
}
int[][] data = new int[domains.size()][];
for (int i = 0; i < domains.size(); i++) {
data[i] = domains.get(i);
Arrays.sort(data[i]);
}
return data;
} catch (IOException
e) {
e.printStackTrace();
}
return null;
}
protected int[][] readVAR(String filename) {
FileReader f;
String line;
TIntList values = new TIntArrayList();
try {
f = new FileReader(filename);
BufferedReader r = new BufferedReader(f);
List ints = new ArrayList<>();
while ((line = r.readLine()) != null) {
Scanner sc = new Scanner(line);
while (sc.hasNextInt()) {
values.add(sc.nextInt());
}
ints.add(values.toArray());
values.clear();
}
int[][] data = new int[ints.size()][];
for (int i = 0; i < ints.size(); i++) {
data[i] = ints.get(i);
}
return data;
} catch (IOException
e) {
e.printStackTrace();
}
return null;
}
protected int[][] readCTR(String filename) {
FileReader f;
String line;
TIntList values = new TIntArrayList();
try {
f = new FileReader(filename);
BufferedReader r = new BufferedReader(f);
List ints = new ArrayList<>();
while ((line = r.readLine()) != null) {
Scanner sc = new Scanner(line);
values.add(sc.nextInt());
values.add(sc.nextInt());
sc.next();
values.add(sc.next().equals("=") ? 0 : 1);
values.add(sc.nextInt());
ints.add(values.toArray());
values.clear();
}
int[][] data = new int[ints.size()][];
for (int i = 0; i < ints.size(); i++) {
data[i] = ints.get(i);
}
return data;
} catch (IOException
e) {
e.printStackTrace();
}
return null;
}
}
