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