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	30	1	5	553	164.25	29392.5	
r_0t	x_ijt	q_it	and_so_on
1842	-1
1842	0	0	19	53	12	198	1	68	20	168	8	55	0	0	29	198	25	178	0	0	30	54	13	104	3	38	21	17	2	12	5	112	17	118	4	82	0	0	10	87	9	166	27	128	16	91	28	66	0	0	11	176	23	136	18	120	15	102	0	0	-1
1842	0	0	4	41	22	94	7	112	2	24	26	134	21	34	3	76	30	27	0	0	24	168	0	0	25	89	6	264	15	51	14	112.333	0	0	-1
1842	0	0	29	198	25	89	14	239.666	0	0	9	166	27	64	16	273	0	0	19	159	12	198	11	176	0	0	8	165	20	168	1	68	28	66	18	60	0	0	10	261	5	112	17	118	0	0	-1
1842	0	0	6	176	30	54	24	112	0	0	15	102	4	82	22	94	5	56	27	128	9	83	0	0	7	112	2	24	26	134	21	34	3	76	13	156	0	0	18	120	23	204	11	88	0	0	-1
1842	0	0	29	198	0	0	-1