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