7 DEBUG_DEFINE_DEBUGF(value);
9 typedef struct { int mass, volu; } CommodInfo;
10 static int commodstablesz;
11 static CommodInfo *commodstable;
13 static sqlite3_stmt *ss_ipair_dist, *ss_ipair_trades;
14 static sqlite3_stmt *ss_ite_buy, *ss_ite_sell;
16 #define MAX_LEGS (MAX_ROUTELEN-1)
19 int commodid, src_price, dst_price;
22 #define TRADES_PER_BLOCK 10
24 typedef struct TradesBlock{
25 struct TradesBlock *next;
26 Trade t[TRADES_PER_BLOCK];
30 double distance_loss_factor;
35 IslandPair ***ipairs; /* ipairs[sislandid][dislandid] */
37 typedef struct IslandTradeEnd {
38 struct IslandTradeEnd *next;
41 unsigned long generation;
46 IslandTradeEnd *src, *dst;
47 } IslandTradeEndHeads;
49 IslandTradeEndHeads *itradeends;
50 /* itradeends[islandid].{src,dst}->commodid etc. */
53 static unsigned long generation;
55 static int nconstraint_rows;
56 static int constraint_rows[1+2+3*MAX_LEGS];
57 static double constraint_coeffs[1+2+3*MAX_LEGS];
58 /* dummy0, src, dst, for_each_leg( [mass], [volume], [capital] ) */
60 static void add_constraint(int row, double coefficient) {
61 nconstraint_rows++; /* glpk indices start from 1 !!! */
62 constraint_rows [nconstraint_rows]= row;
63 constraint_coeffs[nconstraint_rows]= coefficient;
66 static void avail_c(const Trade *t, IslandTradeEnd **trades,
67 int price, const char *srcdst,
68 int islandid, sqlite3_stmt *ss_ite) {
69 /* find row number of trade availability constraint */
70 IslandTradeEnd *search;
72 for (search= *trades; search; search=search->next)
73 if (search->commodid==t->commodid && search->price==price)
75 /* not found, add new row */
77 search= mmalloc(sizeof(*search));
78 search->commodid= t->commodid;
80 search->next= *trades;
81 search->generation= 0;
83 SQL_BIND(ss_ite, 1, islandid);
84 SQL_BIND(ss_ite, 2, t->commodid);
85 SQL_BIND(ss_ite, 3, price);
86 assert(SQL_STEP(ss_ite));
87 search->qty= sqlite3_column_int(ss_ite, 0);
88 SQL_MUST( sqlite3_reset(ss_ite) );
93 if (search->generation != generation) {
94 search->rownum= lpx_add_rows(lp, 1);
95 lpx_set_row_bnds(lp, search->rownum, LPX_UP, 0, search->qty);
97 if (DEBUGP(value) || DEBUGP(check)) {
98 char *name= masprintf("%s_i%d_c%d_%d_all",
99 srcdst, islandid, t->commodid, price);
100 lpx_set_row_name(lp,search->rownum,name);
103 int nrows= lpx_get_num_rows(lp);
104 assert(search->rownum == nrows);
106 for (i=1; i<nrows; i++)
107 assert(strcmp(name, lpx_get_row_name(lp,i)));
111 search->generation= generation;
114 add_constraint(search->rownum, 1.0);
117 static int setup_leg_constraints(double max_thing, int legs, const char *wh) {
119 if (max_thing < 0 || !legs) return -1;
120 startrow= lpx_add_rows(lp, legs);
121 for (leg=0; leg<legs; leg++) {
122 int row= leg+startrow;
123 lpx_set_row_bnds(lp, row, LPX_UP, 0, max_thing);
125 char *name= masprintf("%s_%d",wh,leg);
126 lpx_set_row_name(lp,row,name);
133 static void add_leg_c(int startrow, int leg, double value) {
134 if (startrow<=0) return;
136 add_constraint(startrow+leg, value);
139 static IslandPair *ipair_get(int si, int di) {
140 IslandPair *ip, **ipa;
142 assert(si < islandtablesz);
143 assert(di < islandtablesz);
145 if (!(ipa= ipairs[si])) {
146 ipa= ipairs[si]= mcalloc(sizeof(*ipa) * islandtablesz);
151 ipa[di]= ip= mmalloc(sizeof(*ip));
154 int inblock= TRADES_PER_BLOCK;
155 TradesBlock *block=0, **tail=&ip->trades;
157 debugf("VALUE ipair_get(%d,%d) running...\n", si,di);
158 SQL_MUST( sqlite3_bind_int(ss_ipair_dist, 1, si) );
159 SQL_MUST( sqlite3_bind_int(ss_ipair_dist, 2, di) );
160 assert(SQL_STEP(ss_ipair_dist));
161 int dist= sqlite3_column_int(ss_ipair_dist, 0);
162 ip->distance_loss_factor= pow(distance_loss_factor_per_league, dist);
163 sqlite3_reset(ss_ipair_dist);
165 SQL_MUST( sqlite3_bind_int(ss_ipair_trades, 1, si) );
166 SQL_MUST( sqlite3_bind_int(ss_ipair_trades, 2, di) );
168 while (SQL_STEP(ss_ipair_trades)) {
169 if (inblock == TRADES_PER_BLOCK) {
170 block= mmalloc(sizeof(*block));
177 for (i=0, irp=&block->t[inblock].commodid; i<3; i++, irp++)
178 *irp= sqlite3_column_int(ss_ipair_trades, i);
182 if (inblock < TRADES_PER_BLOCK)
183 block->t[inblock].commodid= -1;
185 sqlite3_reset(ss_ipair_trades);
190 double value_route(int nislands, const int *islands) {
193 /* We need to construct the LP problem. GLPK talks
194 * about rows and columns, which are numbered from 1.
196 * Each column is a `structural variable' ie one of the entries in
197 * the objective function. In our case the set of structural
198 * variable is, for each port, the set of Trades which collect at
199 * that island. (We use `port' to mean `specific visit to an
200 * island' so if an island appears more than once so do its trades.)
201 * We don't need to worry about crossing with all the possible
202 * delivery locations as we always deliver on the first port.
203 * We will call such a structural variable a Flow, for brevity.
205 * We iterate over the possible Flows adding them as columns as we
206 * go, and also adding their entries to the various constraints.
208 * Each row is an `auxiliary variable' ie one of the constraints.
209 * We have two kinds of constraint:
210 * - mass/volume/capital: one constraint for each sailed leg
211 * (unless relevant constraint is not satisfied)
212 * - quantity of commodity available for collection
213 * or delivery at particular price and island
214 * The former are numbered predictably: we have first all the mass
215 * limits, then all the volume limits, then all the capital limits
216 * (as applicable) - one for each leg, ie one for each entry
217 * in islands except the first.
219 * The latter are added as needed and the row numbers are stored in
220 * a data structure for later reuse.
223 assert(nislands >= 1);
224 assert(++generation);
227 lp= lpx_create_prob();
228 lpx_set_obj_dir(lp, LPX_MAX);
229 lpx_set_int_parm(lp, LPX_K_MSGLEV, DEBUGP(lp) ? 3 : 1);
232 lpx_set_prob_name(lp,(char*)"value_route");
233 lpx_set_obj_name(lp,(char*)"profit");
236 int legs= nislands-1;
237 int mass_constraints= setup_leg_constraints(max_mass, legs, "mass");
238 int volu_constraints= setup_leg_constraints(max_volu, legs, "volu");
239 int capi_constraints= setup_leg_constraints(max_capi, legs, "capi");
241 double delay_slot_loss_factor= 1.0;
244 s++, delay_slot_loss_factor *= LOSS_FACTOR_PER_DELAY_SLOT) {
247 for (d=s; d<nislands; d++) {
250 for (already_d=s+1; already_d<d; already_d++)
251 if (islands[already_d] == di)
252 /* visited this island already since we left s, uninteresting */
256 /* route has returned to si, no need to think more about s */
259 /*----- actually add these trades to the LP problem -----*/
261 IslandPair *ip= ipair_get(islands[s], islands[d]);
262 TradesBlock *block= ip->trades;
263 int tradestodo= ip->ntrades;
268 int col= lpx_add_cols(lp,ip->ntrades);
270 double loss_factor= delay_slot_loss_factor * ip->distance_loss_factor;
271 debugf(" SOME i%d#%d..i%d#%d dslf=%g dlf=%g lf=%g\n",
273 delay_slot_loss_factor, ip->distance_loss_factor, loss_factor);
275 while (tradestodo-- >0) {
276 if (inblock >= TRADES_PER_BLOCK) {
280 Trade *t= &block->t[inblock++];
282 debugf(" TRADE i%d#%d..i%d#%d c%d %d-%d ",
283 si,s, di,d, t->commodid, t->src_price, t->dst_price);
287 avail_c(t, &itradeends[si].src, t->src_price, "src", si, ss_ite_sell);
288 avail_c(t, &itradeends[di].dst, t->dst_price, "dst", di, ss_ite_buy);
291 for (leg=s; leg<d; leg++) {
292 add_leg_c(mass_constraints,leg, commodstable[t->commodid].mass*1e-3);
293 add_leg_c(volu_constraints,leg, commodstable[t->commodid].volu*1e-3);
294 add_leg_c(capi_constraints,leg, t->src_price);
297 double unit_profit= t->dst_price * loss_factor - t->src_price;
298 debugf(" unit profit %f\n", unit_profit);
300 lpx_set_col_bnds(lp, col, LPX_LO, 0, 0);
301 lpx_set_obj_coef(lp, col, unit_profit);
302 lpx_set_mat_col(lp, col, nconstraint_rows,
303 constraint_rows, constraint_coeffs);
306 char *name= masprintf("c%d_p%d_%d_p%d_%d",
307 t->commodid, s, t->src_price, d, t->dst_price);
308 lpx_set_col_name(lp, col, name);
313 } /* while (tradestodo-- >0) */
315 /*----- that's done adding these trades to the LP problem -----*/
324 if (lpx_get_num_cols(lp)) {
326 lpx_write_cpxlp(lp, (char*)DEBUG_DEV);
328 int ipr= lpx_simplex(lp);
329 assert(ipr==LPX_E_OK);
332 lpx_print_sol(lp, (char*)DEBUG_DEV);
334 int lpst= lpx_get_status(lp);
335 assert(lpst == LPX_OPT);
336 profit= lpx_get_obj_val(lp);
345 void setup_value(void) {
349 commodstablesz= sql_single_int("SELECT max(commodid) FROM commods") + 1;
350 commodstable= mmalloc(sizeof(*commodstable)*commodstablesz);
351 for (i=0; i<commodstablesz; i++)
352 commodstable[i].mass= commodstable[i].volu= -1;
354 itradeends= mcalloc(sizeof(*itradeends) * islandtablesz);
357 "SELECT commodid,unitmass,unitvolume FROM commods");
358 while (SQL_STEP(sst)) {
359 int id= sqlite3_column_int(sst,0);
360 assert(id>=0 && id<commodstablesz);
361 commodstable[id].mass= sqlite3_column_int(sst,1);
362 commodstable[id].volu= sqlite3_column_int(sst,2);
364 sqlite3_finalize(sst);
366 SQL_PREPARE(ss_ipair_dist,
367 " SELECT dist FROM dists\n"
368 " WHERE aiid=? and biid=?");
370 SQL_PREPARE(ss_ipair_trades,
372 " sell.commodid commodid,\n"
373 " sell.price src_price,\n"
374 " buy.price dst_price\n"
375 " FROM sell JOIN buy\n"
376 " ON sell.commodid = buy.commodid\n"
377 " AND buy.price > sell.price\n"
378 " WHERE sell.islandid=?\n"
379 " AND buy.islandid=?");
382 SQL_PREPARE(ss_ite_##bs, \
386 " WHERE islandid=?\n" \
387 " AND commodid=?\n" \
393 ipairs= mcalloc(sizeof(*ipairs) * islandtablesz);