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