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	4	355	55.42	10136	
r_0t	x_ijt	q_it	and_so_on
947	-1
947	0	0	6	198	7	54	19	82	1	16	0	0	9	90	14	34	0	0	13	64	8	57	4	54	15	51	12	84	17	26	0	0	3	150	18	130	20	75	0	0	-1
947	0	0	9	45	16	60	7	27	10	155	19	41	0	0	5	183	13	32	8	114	0	0	2	74	11	132	20	55	0	0	-1
947	0	0	2	222	20	130	0	0	15	153	12	42	3	141	1	16	0	0	-1
947	0	0	13	64	8	114	4	54	17	39	12	84	0	0	11	44	3	84	18	130	20	65	1	32	0	0	19	82	10	149	9	90	14	34	0	0	5	61	16	40	7	54	6	198	0	0	-1
947	-1