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	30	1	5	553	134.46	14522.2	
r_0t	x_ijt	q_it	and_so_on
1842	0	0	14	88	19	53	23	68	12	99	1	34	20	84	8	55	0	0	29	99	0	0	-1
1842	0	0	25	178	6	176	30	54	24	112	0	0	15	102	22	94	2	24	5	112	10	87	17	118	0	0	9	166	27	128	16	182	28	66	0	0	4	82	7	112	21	34	26	134	3	76	13	104	0	0	11	176	23	68	18	120	0	0	-1
1842	0	0	29	198	0	0	-1
1842	0	0	19	53	12	297	11	176	0	0	8	165	20	252	1	102	0	0	4	51.666	17	118	5	112	2	12	21	17	3	38	13	104	30	54	0	0	24	112	15	102	14	264	0	0	18	60	27	64	9	166	10	261	0	0	-1
1842	0	0	29	198	0	0	11	88	19	106	23	204	18	120	0	0	25	267	6	176	30	27	15	51	0	0	4	71.333	22	94	7	112	2	24	26	134	21	34	3	76	0	0	28	99	16	182	9	83	27	128	5	56	0	0	-1
1842	-1