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	
1	2	15	2	4	323	33.11	8888.59	
r_0t	x_ijt	q_it	and_so_on
861	-1
861	0	0	3	184	14	60	0	0	9	68	1	55	8	113	4	76	0	0	11	72	12	166	0	0	13	10	6	22	2	198	15	92	0	0	-1
861	0	0	1	110	8	61	4	152	0	0	7	71	14	30	2	99	0	0	5	291	0	0	12	83	13	20	10	189	0	0	-1
861	0	0	15	92	3	184	0	0	11	72	7	213	0	0	-1
861	0	0	15	46	1	110	8	58	9	68	0	0	3	92	4	152	0	0	5	121	11	36	12	166	0	0	14	60	2	158	6	22	13	20	10	63	0	0	-1
861	-1