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 void avail_c(const Trade *t, IslandTradeEnd **trades,
66 int price, const char *srcdst,
67 int islandid, sqlite3_stmt *ss_ite) {
68 /* find row number of trade availability constraint */
69 IslandTradeEnd *search;
71 for (search= *trades; search; search=search->next)
72 if (search->commodid==t->commodid && search->price==price)
77 if (search->generation != generation) {
78 search->rownum= lpx_add_rows(lp, 1);
79 lpx_set_row_bnds(lp, search->rownum, LPX_UP, 0, search->qty);
81 if (DEBUGP(value) || DEBUGP(check)) {
82 char *name= masprintf("%s_i%d_c%d_%d_all",
83 srcdst, islandid, t->commodid, price);
84 lpx_set_row_name(lp,search->rownum,name);
87 int nrows= lpx_get_num_rows(lp);
88 assert(search->rownum == nrows);
90 for (i=1; i<nrows; i++)
91 assert(strcmp(name, lpx_get_row_name(lp,i)));
95 search->generation= generation;
98 add_constraint(search->rownum, 1.0);
101 static int setup_leg_constraints(double max_thing, int legs, const char *wh) {
103 if (max_thing < 0 || !legs) return -1;
104 startrow= lpx_add_rows(lp, legs);
105 for (leg=0; leg<legs; leg++) {
106 int row= leg+startrow;
107 lpx_set_row_bnds(lp, row, LPX_UP, 0, max_thing);
109 char *name= masprintf("%s_%d",wh,leg);
110 lpx_set_row_name(lp,row,name);
117 static void add_leg_c(int startrow, int leg, double value) {
118 if (startrow<=0) return;
120 add_constraint(startrow+leg, value);
123 IslandPair *ipair_get_maybe(int si, int di) {
126 assert(si < islandtablesz);
127 assert(di < islandtablesz);
129 if (!(ipa= ipairs[si])) return 0;
133 static IslandPair *ipair_get_create(int si, int di) {
134 IslandPair *ip, **ipa;
136 assert(si < islandtablesz);
137 assert(di < islandtablesz);
139 if (!(ipa= ipairs[si])) {
140 ipairs[si]= MCALLOC(ipa, islandtablesz);
147 ip->route_tail_value= -1;
149 if (si==di) ctr_islands_arbitrage++;
150 else ctr_ipairs_relevant++;
152 debug2f("VALUE ipair_get(i%d,i%d) running...\n", si,di);
153 SQL_MUST( sqlite3_bind_int(ss_ipair_dist, 1, si) );
154 SQL_MUST( sqlite3_bind_int(ss_ipair_dist, 2, di) );
155 assert(SQL_STEP(ss_ipair_dist));
156 int dist= sqlite3_column_int(ss_ipair_dist, 0);
157 ip->distance_loss_factor= pow(distance_loss_factor_per_league, dist);
158 sqlite3_reset(ss_ipair_dist);
163 double value_route(int nislands, const int *islands, int exclude_arbitrage) {
166 ctr_subroutes_valued++;
168 /* We need to construct the LP problem. GLPK talks
169 * about rows and columns, which are numbered from 1.
171 * Each column is a `structural variable' ie one of the entries in
172 * the objective function. In our case the set of structural
173 * variable is, for each port, the set of Trades which collect at
174 * that island. (We use `port' to mean `specific visit to an
175 * island' so if an island appears more than once so do its trades.)
176 * We don't need to worry about crossing with all the possible
177 * delivery locations as we always deliver on the first port.
178 * We will call such a structural variable a Flow, for brevity.
180 * We iterate over the possible Flows adding them as columns as we
181 * go, and also adding their entries to the various constraints.
183 * Each row is an `auxiliary variable' ie one of the constraints.
184 * We have two kinds of constraint:
185 * - mass/volume/capital: one constraint for each sailed leg
186 * (unless relevant constraint is not satisfied)
187 * - quantity of commodity available for collection
188 * or delivery at particular price and island
189 * The former are numbered predictably: we have first all the mass
190 * limits, then all the volume limits, then all the capital limits
191 * (as applicable) - one for each leg, ie one for each entry
192 * in islands except the first.
194 * The latter are added as needed and the row numbers are stored in
195 * a data structure for later reuse.
198 assert(nislands >= 1);
199 assert(++generation);
202 lp= lpx_create_prob();
203 lpx_set_obj_dir(lp, LPX_MAX);
204 lpx_set_int_parm(lp, LPX_K_MSGLEV, DEBUGP(lp) ? 3 : 1);
205 lpx_set_int_parm(lp, LPX_K_PRESOL, 1);
208 lpx_set_prob_name(lp,(char*)"value_route");
209 lpx_set_obj_name(lp,(char*)"profit");
212 int legs= nislands-1;
213 int mass_constraints= setup_leg_constraints(max_mass, legs, "mass");
214 int volu_constraints= setup_leg_constraints(max_volu, legs, "volu");
215 int capi_constraints= setup_leg_constraints(max_capi, legs, "capi");
217 double delay_slot_loss_factor= 1.0;
220 s++, delay_slot_loss_factor *= LOSS_FACTOR_PER_DELAY_SLOT) {
223 for (d= s + exclude_arbitrage;
228 for (already_d=s+1; already_d<d; already_d++)
229 if (islands[already_d] == di)
230 /* visited this island already since we left s, uninteresting */
234 /* route has returned to si, no need to think more about s */
237 /*----- actually add these trades to the LP problem -----*/
239 IslandPair *ip= ipair_get_maybe(islands[s], islands[d]);
241 if (!ip || !ip->trades)
244 double loss_factor= delay_slot_loss_factor * ip->distance_loss_factor;
245 debugf(" SOME i%d#%d..i%d#%d dslf=%g dlf=%g lf=%g\n",
247 delay_slot_loss_factor, ip->distance_loss_factor, loss_factor);
250 for (block=ip->trades; block; block=block->next) {
252 for (inblock=0; inblock<block->ntrades; inblock++) {
253 Trade *t= &block->t[inblock];
255 debugf(" TRADE i%d#%d..i%d#%d c%d %d-%d ",
256 si,s, di,d, t->commodid, t->src_price, t->dst_price);
260 avail_c(t, &itradeends[si].src, t->src_price, "src", si,ss_ite_sell);
261 avail_c(t, &itradeends[di].dst, t->dst_price, "dst", di,ss_ite_buy);
264 for (leg=s; leg<d; leg++) {
265 add_leg_c(mass_constraints,leg, commodstab[t->commodid].mass*1e-3);
266 add_leg_c(volu_constraints,leg, commodstab[t->commodid].volu*1e-3);
267 add_leg_c(capi_constraints,leg, t->src_price);
270 double unit_profit= t->dst_price * loss_factor - t->src_price;
271 debugf(" unit profit %f\n", unit_profit);
272 if (unit_profit <= 0) continue;
274 int col= lpx_add_cols(lp,1);
275 lpx_set_col_bnds(lp, col, LPX_LO, 0, 0);
276 lpx_set_obj_coef(lp, col, unit_profit);
277 lpx_set_mat_col(lp, col, nconstraint_rows,
278 constraint_rows, constraint_coeffs);
281 char *name= masprintf("c%d_p%d_%d_p%d_%d", t->commodid,
282 s, t->src_price, d, t->dst_price);
283 lpx_set_col_name(lp, col, name);
289 /*----- that's done adding these trades to the LP problem -----*/
298 if (lpx_get_num_cols(lp)) {
299 ctr_subroutes_nonempty++;
302 lpx_write_cpxlp(lp, (char*)DEBUG_DEV);
304 int ipr= lpx_simplex(lp);
305 assert(ipr==LPX_E_OK);
308 lpx_print_sol(lp, (char*)DEBUG_DEV);
310 int lpst= lpx_get_status(lp);
311 assert(lpst == LPX_OPT);
312 profit= lpx_get_obj_val(lp);
319 exclude_arbitrage ? "base value" : "route value",
325 " FROM sell, buy\n" \
326 " WHERE sell.commodid=buy.commodid AND sell.price < buy.price\n"
328 static void read_trades(void) {
329 /* We would like to use DISTINCT but sqlite3 is too stupid
330 * to notice that it could use the index to do the DISTINCT
331 * which makes it rather slow. */
332 sqlite3_stmt *ss_trades;
335 "sell.commodid, sell.islandid, sell.price, buy.islandid, buy.price"
336 SQL_PREPARE(ss_trades,
337 " SELECT " TRADE_COLS "\n"
339 " ORDER BY " TRADE_COLS);
341 SQL_DISTINCT_DECL(cols,5);
342 while (SQL_DISTINCT_STEP(ss_trades,cols,5)) {
344 IslandPair *ip= ipair_get_create(cols[1], cols[3]);
345 TradesBlock *block= ip->trades;
346 if (!block || ip->trades->ntrades >= TRADES_PER_BLOCK) {
348 block->next= ip->trades;
352 Trade *trade= &block->t[block->ntrades];
353 trade->commodid= cols[0];
354 trade->src_price= cols[2];
355 trade->dst_price= cols[4];
358 sqlite3_finalize(ss_trades);
361 static void read_islandtradeends(const char *bs, int srcdstoff) {
363 #define TRADEEND_KEYCOLS "%s.commodid, %s.islandid, %s.stallid"
364 char *stmt= masprintf(" SELECT " TRADEEND_KEYCOLS ", %s.price, %s.qty\n"
366 " ORDER BY " TRADEEND_KEYCOLS,
367 bs,bs,bs,bs,bs, bs,bs,bs);
368 char *stmt_id= masprintf("qtys (%s)",bs);
369 sqlite3_stmt *ss= sql_prepare(stmt, stmt_id);
370 free(stmt); free(stmt_id);
372 SQL_DISTINCT_DECL(cols,5);
373 while (SQL_DISTINCT_STEP(ss,cols,3)) {
374 ctr_quantities_loaded++;
375 IslandTradeEnd *search;
377 int commodid= cols[0];
378 int islandid= cols[1];
382 IslandTradeEnd **trades= (void*)((char*)&itradeends[islandid] + srcdstoff);
384 for (search= *trades; search; search=search->next)
385 if (search->commodid==commodid && search->price==price)
387 /* not found, add new end */
390 search->commodid= commodid;
391 search->price= price;
392 search->next= *trades;
393 search->generation= 0;
400 sqlite3_finalize(ss);
403 void setup_value(void) {
406 commodstabsz= sql_single_int("SELECT max(commodid) FROM commods") + 1;
407 MCALLOC_INITEACH(commodstab, commodstabsz,
408 this->mass= this->volu= -1
412 "SELECT commodid,unitmass,unitvolume FROM commods");
413 while (SQL_STEP(sst)) {
414 ctr_commodities_loaded++;
415 int id= sqlite3_column_int(sst,0);
416 assert(id>=0 && id<commodstabsz);
417 commodstab[id].mass= sqlite3_column_int(sst,1);
418 commodstab[id].volu= sqlite3_column_int(sst,2);
420 sqlite3_finalize(sst);
422 MCALLOC(ipairs, islandtablesz);
423 MCALLOC(itradeends, islandtablesz);
425 SQL_PREPARE(ss_ipair_dist,
426 " SELECT dist FROM dists\n"
427 " WHERE aiid=? and biid=?");
430 read_islandtradeends("sell", offsetof(IslandTradeEndHeads, src));
431 read_islandtradeends("buy", offsetof(IslandTradeEndHeads, dst));