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	20	3	1	1420	35.22	7132.05	
r_0t	x_ijt	q_it	and_so_on
947	-1
947	0	0	13	64	8	114	4	27	15	51	17	26	12	84	2	148	3	75	19	82	10	152	7	54	6	198	9	90	20	130	0	0	-1
947	0	0	14	51	5	183	9	45	16	60	7	27	19	41	18	195	3	150	11	132	20	65	1	32	0	0	-1
947	0	0	13	64	8	98	4	81	15	153	12	42	17	26	0	0	-1
947	0	0	8	73	12	84	2	148	20	130	11	44	3	150	18	65	19	82	10	152	6	198	7	54	16	40	9	90	5	61	14	17	1	32	0	0	-1
947	0	0	13	64	0	0	-1