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	4	323	31.32	16144.5	
r_0t	x_ijt	q_it	and_so_on
861	-1
861	0	0	3	184	0	0	15	46	2	198	14	60	0	0	1	55	8	61	4	152	0	0	10	63	13	20	12	83	11	72	0	0	-1
861	0	0	12	166	7	142	0	0	14	30	15	92	6	11	1	110	9	68	0	0	5	291	0	0	-1
861	0	0	10	63	13	10	6	33	2	198	0	0	11	72	3	184	0	0	8	171	4	152	0	0	-1
861	0	0	12	166	7	142	0	0	15	92	14	60	13	20	10	126	0	0	1	110	9	68	0	0	5	194	0	0	-1
861	0	0	3	184	4	76	0	0	11	72	0	0	-1