Inventory Routing Problem - Instances From Archetti et al. (2007)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
2	2	15	2	2	646	47.6	13357.9	
r_0t	x_ijt	q_it	and_so_on
861	0	0	11	36	0	0	-1
861	0	0	3	184	4	76	8	0	1	55	6	22	2	198	15	92	0	0	5	194	12	83	13	20	10	63	14	60	0	0	-1
861	0	0	3	92	1	110	8	116	9	68	4	152	0	0	11	72	12	166	7	71	0	0	-1
861	0	0	7	71	10	189	13	10	14	60	2	198	15	46	0	0	5	194	0	0	-1
861	0	0	11	72	12	166	13	20	6	22	2	99	15	92	14	30	7	142	0	0	3	184	1	110	8	116	9	68	4	152	0	0	-1
861	-1