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	1	2763	73.22	23592	
r_0t	x_ijt	q_it	and_so_on
1842	-1
1842	0	0	29	198	18	60	11	176	8	110	20	168	1	68	16	182	9	166	27	64	5	112	2	24	17	118	15	102	4	82	7	112	21	34	26	134	3	76	13	104	30	54	6	176	24	112	25	178	0	0	-1
1842	0	0	25	89	14	176	15	51	4	41	22	94	5	56	27	128	9	83	10	174	28	99	12	297	23	204	19	53	18	120	0	0	-1
1842	0	0	29	198	24	112	6	176	30	54	13	104	3	38	21	17	2	12	17	118	28	33	1	68	12	99	23	68	19	159	11	176	0	0	-1
1842	0	0	18	120	11	88	8	110	20	252	16	182	27	128	9	166	10	174	5	112	2	24	26	134	3	76	21	34	7	112	22	94	4	82	15	102	14	176	30	27	24	56	25	178	29	99	0	0	-1
1842	-1