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	25	5	2	1078	79.81	9217.04	
r_0t	x_ijt	q_it	and_so_on
1437	-1
1437	0	0	11	19	5	23	21	108	15	56	16	118	14	76	12	196	4	37	8	75	18	46	7	94	24	28	9	58	3	49	0	0	13	67	6	158	17	150	0	0	-1
1437	0	0	19	222	3	98	9	116	23	198	14	152	16	59	6	79	13	134	0	0	2	84	5	46	20	80	21	54	10	93	25	264	22	90	15	112	1	128	0	0	-1
1437	0	0	11	57	10	31	25	88	22	270	4	111	8	225	18	46	7	47	24	28	19	74	0	0	-1
1437	0	0	3	98	9	116	24	14	7	94	23	198	6	158	13	134	17	150	0	0	16	118	14	152	12	196	15	112	21	108	1	128	20	80	5	46	2	84	0	0	-1
1437	-1