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	20	3	2	710	76.98	15300.7	
r_0t	x_ijt	q_it	and_so_on
947	-1
947	0	0	9	90	16	40	7	54	6	109	10	76	19	82	18	65	3	150	11	44	0	0	1	16	20	130	2	74	12	84	17	26	15	51	4	27	8	114	13	64	0	0	-1
947	0	0	5	165	14	34	0	0	-1
947	0	0	11	44	3	75	18	195	19	82	10	76	6	89	7	27	16	40	9	82	0	0	1	16	20	65	2	74	12	42	15	153	4	81	8	114	13	64	0	0	-1
947	0	0	1	32	20	130	11	88	3	150	2	148	12	84	17	39	0	0	19	41	10	152	7	54	6	297	9	53	5	79	14	34	0	0	-1
947	0	0	8	114	13	64	0	0	-1