7 DEBUG_DEFINE_DEBUGF(value);
8 DEBUG_DEFINE_SOME_DEBUGF(value2,debug2f);
10 typedef struct { int mass, volu; } CommodInfo;
11 static int commodstabsz;
12 static CommodInfo *commodstab;
14 static sqlite3_stmt *ss_ipair_dist;
15 static sqlite3_stmt *ss_ite_buy, *ss_ite_sell;
18 #define MAX_LEGS (MAX_ROUTELEN-1)
21 int commodid, src_price, dst_price;
24 #define TRADES_PER_BLOCK 10
26 typedef struct TradesBlock {
27 struct TradesBlock *next;
29 Trade t[TRADES_PER_BLOCK];
32 static IslandPair ***ipairs; /* ipairs[sislandid][dislandid] */
34 typedef struct IslandTradeEnd {
35 struct IslandTradeEnd *next;
40 unsigned long generation;
45 IslandTradeEnd *src, *dst;
46 } IslandTradeEndHeads;
48 IslandTradeEndHeads *itradeends;
49 /* itradeends[islandid].{src,dst}->commodid etc. */
52 static unsigned long generation;
54 static int nconstraint_rows;
55 static int constraint_rows[1+2+3*MAX_LEGS];
56 static double constraint_coeffs[1+2+3*MAX_LEGS];
57 /* dummy0, src, dst, for_each_leg( [mass], [volume], [capital] ) */
59 static void add_constraint(int row, double coefficient) {
60 nconstraint_rows++; /* glpk indices start from 1 !!! */
61 constraint_rows [nconstraint_rows]= row;
62 constraint_coeffs[nconstraint_rows]= coefficient;
65 static IslandTradeEnd *get_ite(const Trade *t, IslandTradeEnd **trades,
67 IslandTradeEnd *search;
69 for (search= *trades; search; search=search->next)
70 if (search->commodid==t->commodid && search->price==price)
75 static void avail_c(const Trade *t, IslandTradeEnd *ite,
76 int price, const char *srcdst,
77 int islandid, sqlite3_stmt *ss_ite) {
78 /* find row number of trade availability constraint */
79 IslandTradeEnd *search= ite;
81 if (search->generation != generation) {
82 search->rownum= lpx_add_rows(lp, 1);
83 lpx_set_row_bnds(lp, search->rownum, LPX_UP, 0, search->qty);
85 if (DEBUGP(value) || DEBUGP(check)) {
86 char *name= masprintf("%s_i%d_c%d_%d_all",
87 srcdst, islandid, t->commodid, price);
88 lpx_set_row_name(lp,search->rownum,name);
91 int nrows= lpx_get_num_rows(lp);
92 assert(search->rownum == nrows);
94 for (i=1; i<nrows; i++)
95 assert(strcmp(name, lpx_get_row_name(lp,i)));
99 search->generation= generation;
102 add_constraint(search->rownum, 1.0);
105 static int setup_leg_constraints(double max_thing, int legs, const char *wh) {
107 if (max_thing < 0 || !legs) return -1;
108 startrow= lpx_add_rows(lp, legs);
109 for (leg=0; leg<legs; leg++) {
110 int row= leg+startrow;
111 lpx_set_row_bnds(lp, row, LPX_UP, 0, max_thing);
113 char *name= masprintf("%s_%d",wh,leg);
114 lpx_set_row_name(lp,row,name);
121 static void add_leg_c(int startrow, int leg, double value) {
122 if (startrow<=0) return;
124 add_constraint(startrow+leg, value);
127 IslandPair *ipair_get_maybe(int si, int di) {
130 assert(si < islandtablesz);
131 assert(di < islandtablesz);
133 if (!(ipa= ipairs[si])) return 0;
137 static IslandPair *ipair_get_create(int si, int di) {
138 IslandPair *ip, **ipa;
140 assert(si < islandtablesz);
141 assert(di < islandtablesz);
143 if (!(ipa= ipairs[si])) {
144 ipairs[si]= MCALLOC(ipa, islandtablesz);
151 ip->route_tail_value= -1;
153 if (si==di) ctr_islands_arbitrage++;
154 else ctr_ipairs_relevant++;
156 debug2f("VALUE ipair_get(i%d,i%d) running...\n", si,di);
157 SQL_MUST( sqlite3_bind_int(ss_ipair_dist, 1, si) );
158 SQL_MUST( sqlite3_bind_int(ss_ipair_dist, 2, di) );
159 assert(SQL_STEP(ss_ipair_dist));
160 int dist= sqlite3_column_int(ss_ipair_dist, 0);
161 ip->distance_loss_factor= pow(distance_loss_factor_per_league, dist);
162 sqlite3_reset(ss_ipair_dist);
167 double value_route(int nislands, const int *islands, int exclude_arbitrage) {
170 ctr_subroutes_valued++;
172 /* We need to construct the LP problem. GLPK talks
173 * about rows and columns, which are numbered from 1.
175 * Each column is a `structural variable' ie one of the entries in
176 * the objective function. In our case the set of structural
177 * variable is, for each port, the set of Trades which collect at
178 * that island. (We use `port' to mean `specific visit to an
179 * island' so if an island appears more than once so do its trades.)
180 * We don't need to worry about crossing with all the possible
181 * delivery locations as we always deliver on the first port.
182 * We will call such a structural variable a Flow, for brevity.
184 * We iterate over the possible Flows adding them as columns as we
185 * go, and also adding their entries to the various constraints.
187 * Each row is an `auxiliary variable' ie one of the constraints.
188 * We have two kinds of constraint:
189 * - mass/volume/capital: one constraint for each sailed leg
190 * (unless relevant constraint is not satisfied)
191 * - quantity of commodity available for collection
192 * or delivery at particular price and island
193 * The former are numbered predictably: we have first all the mass
194 * limits, then all the volume limits, then all the capital limits
195 * (as applicable) - one for each leg, ie one for each entry
196 * in islands except the first.
198 * The latter are added as needed and the row numbers are stored in
199 * a data structure for later reuse.
202 assert(nislands >= 1);
203 assert(++generation);
206 lp= lpx_create_prob();
207 lpx_set_obj_dir(lp, LPX_MAX);
208 lpx_set_int_parm(lp, LPX_K_MSGLEV, DEBUGP(lp) ? 3 : 1);
209 lpx_set_int_parm(lp, LPX_K_PRESOL, 1);
212 lpx_set_prob_name(lp,(char*)"value_route");
213 lpx_set_obj_name(lp,(char*)"profit");
216 int legs= nislands-1;
217 int mass_constraints= setup_leg_constraints(max_mass, legs, "mass");
218 int volu_constraints= setup_leg_constraints(max_volu, legs, "volu");
219 int capi_constraints= setup_leg_constraints(max_capi, legs, "capi");
221 double delay_slot_loss_factor= 1.0;
224 s++, delay_slot_loss_factor *= LOSS_FACTOR_PER_DELAY_SLOT) {
227 for (d= s + exclude_arbitrage;
232 for (already_d=s+1; already_d<d; already_d++)
233 if (islands[already_d] == di)
234 /* visited this island already since we left s, uninteresting */
238 /* route has returned to si, no need to think more about s */
241 /*----- actually add these trades to the LP problem -----*/
243 IslandPair *ip= ipair_get_maybe(islands[s], islands[d]);
245 if (!ip || !ip->trades)
248 double loss_factor= delay_slot_loss_factor * ip->distance_loss_factor;
249 debugf(" SOME i%d#%d..i%d#%d dslf=%g dlf=%g lf=%g\n",
251 delay_slot_loss_factor, ip->distance_loss_factor, loss_factor);
254 for (block=ip->trades; block; block=block->next) {
256 for (inblock=0; inblock<block->ntrades; inblock++) {
257 Trade *t= &block->t[inblock];
259 debugf(" TRADE i%d#%d..i%d#%d c%d %d-%d ",
260 si,s, di,d, t->commodid, t->src_price, t->dst_price);
263 *src_ite= get_ite(t, &itradeends[si].src, t->src_price),
264 *dst_ite= get_ite(t, &itradeends[di].dst, t->dst_price);
266 int qty= src_ite->qty < dst_ite->qty ? src_ite->qty : dst_ite->qty;
267 int maxprofit= qty * (t->dst_price - t->src_price);
268 debugf("maxprofit=%d ",maxprofit);
269 if (maxprofit < min_trade_maxprofit) {
276 avail_c(t, src_ite, t->src_price, "src", si,ss_ite_sell);
277 avail_c(t, dst_ite, t->dst_price, "dst", di,ss_ite_buy);
280 for (leg=s; leg<d; leg++) {
281 add_leg_c(mass_constraints,leg, commodstab[t->commodid].mass*1e-3);
282 add_leg_c(volu_constraints,leg, commodstab[t->commodid].volu*1e-3);
283 add_leg_c(capi_constraints,leg, t->src_price);
286 double unit_profit= t->dst_price * loss_factor - t->src_price;
287 debugf(" unit profit %f\n", unit_profit);
288 if (unit_profit <= 0) continue;
290 int col= lpx_add_cols(lp,1);
291 lpx_set_col_bnds(lp, col, LPX_LO, 0, 0);
292 lpx_set_obj_coef(lp, col, unit_profit);
293 lpx_set_mat_col(lp, col, nconstraint_rows,
294 constraint_rows, constraint_coeffs);
297 char *name= masprintf("c%d_p%d_%d_p%d_%d", t->commodid,
298 s, t->src_price, d, t->dst_price);
299 lpx_set_col_name(lp, col, name);
305 /*----- that's done adding these trades to the LP problem -----*/
314 if (lpx_get_num_cols(lp)) {
315 ctr_subroutes_nonempty++;
318 lpx_write_cpxlp(lp, (char*)DEBUG_DEV);
320 int ipr= lpx_simplex(lp);
321 assert(ipr==LPX_E_OK);
324 lpx_print_sol(lp, (char*)DEBUG_DEV);
326 int lpst= lpx_get_status(lp);
327 assert(lpst == LPX_OPT);
328 profit= lpx_get_obj_val(lp);
335 exclude_arbitrage ? "base value" : "route value",
341 " FROM sell, buy\n" \
342 " WHERE sell.commodid=buy.commodid AND sell.price < buy.price\n"
344 static void read_trades(void) {
345 /* We would like to use DISTINCT but sqlite3 is too stupid
346 * to notice that it could use the index to do the DISTINCT
347 * which makes it rather slow. */
348 sqlite3_stmt *ss_trades;
351 "sell.commodid, sell.islandid, sell.price, buy.islandid, buy.price"
352 SQL_PREPARE(ss_trades,
353 " SELECT " TRADE_COLS "\n"
355 " ORDER BY " TRADE_COLS);
357 SQL_DISTINCT_DECL(cols,5);
358 while (SQL_DISTINCT_STEP(ss_trades,cols,5)) {
360 IslandPair *ip= ipair_get_create(cols[1], cols[3]);
361 TradesBlock *block= ip->trades;
362 if (!block || ip->trades->ntrades >= TRADES_PER_BLOCK) {
364 block->next= ip->trades;
368 Trade *trade= &block->t[block->ntrades];
369 trade->commodid= cols[0];
370 trade->src_price= cols[2];
371 trade->dst_price= cols[4];
374 sqlite3_finalize(ss_trades);
377 static void read_islandtradeends(const char *bs, int srcdstoff) {
379 #define TRADEEND_KEYCOLS "%s.commodid, %s.islandid, %s.stallid"
380 char *stmt= masprintf(" SELECT " TRADEEND_KEYCOLS ", %s.price, %s.qty\n"
382 " ORDER BY " TRADEEND_KEYCOLS,
383 bs,bs,bs,bs,bs, bs,bs,bs);
384 char *stmt_id= masprintf("qtys (%s)",bs);
385 sqlite3_stmt *ss= sql_prepare(stmt, stmt_id);
386 free(stmt); free(stmt_id);
388 SQL_DISTINCT_DECL(cols,5);
389 while (SQL_DISTINCT_STEP(ss,cols,3)) {
390 ctr_quantities_loaded++;
391 IslandTradeEnd *search;
393 int commodid= cols[0];
394 int islandid= cols[1];
398 IslandTradeEnd **trades= (void*)((char*)&itradeends[islandid] + srcdstoff);
400 for (search= *trades; search; search=search->next)
401 if (search->commodid==commodid && search->price==price)
403 /* not found, add new end */
406 search->commodid= commodid;
407 search->price= price;
408 search->next= *trades;
409 search->generation= 0;
416 sqlite3_finalize(ss);
419 void setup_value(void) {
422 commodstabsz= sql_single_int("SELECT max(commodid) FROM commods") + 1;
423 MCALLOC_INITEACH(commodstab, commodstabsz,
424 this->mass= this->volu= -1
428 "SELECT commodid,unitmass,unitvolume FROM commods");
429 while (SQL_STEP(sst)) {
430 ctr_commodities_loaded++;
431 int id= sqlite3_column_int(sst,0);
432 assert(id>=0 && id<commodstabsz);
433 commodstab[id].mass= sqlite3_column_int(sst,1);
434 commodstab[id].volu= sqlite3_column_int(sst,2);
436 sqlite3_finalize(sst);
438 MCALLOC(ipairs, islandtablesz);
439 MCALLOC(itradeends, islandtablesz);
441 SQL_PREPARE(ss_ipair_dist,
442 " SELECT dist FROM dists\n"
443 " WHERE aiid=? and biid=?");
446 read_islandtradeends("sell", offsetof(IslandTradeEndHeads, src));
447 read_islandtradeends("buy", offsetof(IslandTradeEndHeads, dst));