OneCritOpt.java
5.92 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
import org.chocosolver.solver.Model;
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.constraints.Constraint;
import org.chocosolver.solver.search.strategy.Search;
import org.chocosolver.solver.variables.IntVar;
import java.io.*;
import java.util.ArrayList;
import java.util.Scanner;
public class OneCritOpt {
public static void giveDomains (Model model, IntVar[] ugs, String dir, IntVar[] crit0, UG[] nodes){
int index = 0;
try {
File allUg = new File(dir + "/ugs_init.txt");
Scanner readerUg = new Scanner(allUg);
File critFile0 = new File(dir + "/crit_file0.txt");
Scanner reader0 = null;
reader0 = new Scanner(critFile0);
while (readerUg.hasNextLine()) {
String dataUg = readerUg.nextLine();
String data0 = null;
data0 = reader0.nextLine();
if(nodes[index].valid) {
String[] str_split = dataUg.split(",", 0);
String[] str_split0 = null;
str_split0 = data0.split(",", 0);
int size = str_split.length;
int[] toInsert = new int[size];
int[] toInsert0 = new int[size];
for (int i = 0; i < size; i++) {
toInsert[i] = Integer.parseInt(str_split[i]);
toInsert0[i] = (int) Float.parseFloat(str_split0[i]);
}
ugs[index] = model.intVar("UG_" + (index), toInsert);
crit0[index] = model.intVar("Crit0_" + (index), toInsert0);
}
else {
ugs[index] = model.intVar("UG_"+(index), 0);
crit0[index] = model.intVar("Crit0"+(index), 0);
}
index++;
}
readerUg.close();
reader0.close();
} catch (FileNotFoundException e) {
System.out.println("An error occurred.");
e.printStackTrace();
}
}
public static void main(String[] args) throws IOException {
int areaLimit = Integer.parseInt(args[0]);
String fileDirectory = args[1];
ArrayList<Integer> islandUGs = new ArrayList<>();
String regionFile = args[4];
File island = new File("subregions/"+regionFile);
Scanner islandReader = new Scanner(island);
while (islandReader.hasNextLine()) {
islandUGs.add(Integer.parseInt(islandReader.nextLine()));
}
islandReader.close();
String criterion = args[3];
/*Set Flags
0-woodYield
1-Soil Loss
2-Perc_r
3-Biodiversity
4-Cashflow
5-Carbon Stock
6-NPV
7-Perc_rait
8-R
9-Rait
10-Sbiom
*/
ArrayList<Boolean> flags = new ArrayList<>();
Model m = new Model("Forest Management");
System.out.println("Reading Input Files");
BufferedReader reader = new BufferedReader(new FileReader(fileDirectory + "/ugs_init.txt"));
int nUgs = 0;
while (reader.readLine() != null) nUgs++;
reader.close();
UG[] nodes = new UG[nUgs];
//if 0 ignore
int minBorder = Integer.parseInt(args[2]);
UG.setupInternalIds(nodes, fileDirectory);
if(minBorder <= 0)
UG.fillOneCrit(nodes, fileDirectory, 0, flags);
else
UG.fillOneCrit(nodes, fileDirectory, minBorder, flags);
for(int i = 0; i < nodes.length; i++){
if(islandUGs.contains(nodes[i].externalId)){
nodes[i].valid = true;
}
}
IntVar[] ugs = new IntVar[nUgs];
IntVar[] crit0 = new IntVar[nUgs];
giveDomains(m, ugs, fileDirectory, crit0, nodes);
System.out.println("Setting up Constraints");
for(int ugIndex = 0; ugIndex < nodes.length; ugIndex++) {
if(nodes[ugIndex].valid && !nodes[ugIndex].noAdjacencies) {
new Constraint("Area Limit Constraint", new CustomPropagatorFloat(ugIndex, nodes, ugs, areaLimit)).post();
}
}
for(int i = 0; i < nodes.length; i++){
if(nodes[i].valid) {
IntVar prescIndex = m.intVar(0, nodes[i].presc.length);
m.element(ugs[i], nodes[i].presc, prescIndex).post();
m.element(crit0[i], nodes[i].crit0, prescIndex).post();
}
else{
m.arithm(crit0[i], "=", 0).post();
}
}
IntVar sum0 = m.intVar("CRIT0_SUM",-99999999, 99999999);
m.sum(crit0,"=", sum0).post();
// Single Criterion Optimization
if(criterion.equalsIgnoreCase("single")) {
m.setObjective(Model.MAXIMIZE, sum0);
Solver s = m.getSolver();
System.out.println("Running Solver");
//s.setSearch(Search.minDomUBSearch(ugs));
s.setSearch(Search.activityBasedSearch(ugs));
long startTime = System.currentTimeMillis();
FileWriter outputPairs;
FileWriter pairCrits;
while(s.solve()) {
System.out.println("FOUND SOLUTION! "+ sum0.toString());
outputPairs = new FileWriter("Results/"+regionFile+"-OptSolution.csv");
pairCrits = new FileWriter("Results/"+regionFile+"-OptSolutionDetails.csv");
for (int i = 0; i < ugs.length; i++) {
if (nodes[i].valid) {
outputPairs.write(nodes[i].externalId + "," + ugs[i].getValue() + "\n");
}
}
outputPairs.flush();
outputPairs.close();
pairCrits.write("TimeStamp: "+(System.currentTimeMillis()-startTime)+"ms\n");
pairCrits.write(sum0.toString()+"\n");
pairCrits.flush();
pairCrits.close();
}
}
}
}