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	3	921	212.43	27088.7	
r_0t	x_ijt	q_it	and_so_on
1842	0	0	15	51	9	83	17	59	4	41	30	27	25	89	0	0	-1
1842	0	0	18	60	19	53	23	136	12	198	1	68	20	168	8	55	11	176	0	0	6	176	24	112	29	198	0	0	13	104	3	76	21	34	26	134	2	12	5	112	27	64	10	174	17	59	4	41	0	0	-1
1842	0	0	25	178	14	256.2	15	102	30	54	29	99	0	0	18	60	12	99	28	99	16	182	9	166	27	128	5	56	2	24	7	56	22	47	0	0	-1
1842	0	0	11	176	8	165	1	68	12	99	23	136	19	159	18	60	0	0	15	51	4	82	22	47	7	168	21	17	3	38	13	104	6	176	24	112	25	89	0	0	-1
1842	0	0	29	198	11	88	20	252	28	66	12	99	23	68	18	120	0	0	25	89	24	56	30	54	3	76	21	34	26	134	2	24	17	177	15	51	14	95.8	0	0	4	41	22	94	5	112	10	174	9	166	27	128	16	182	0	0	-1
1842	-1