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	3	473	55.82	9015.79	
r_0t	x_ijt	q_it	and_so_on
947	-1
947	0	0	20	65	18	130	3	75	0	0	19	82	10	152	7	54	9	90	0	0	17	26	12	84	15	51	4	27	8	114	13	64	0	0	-1
947	0	0	2	148	3	150	11	132	0	0	19	41	6	297	7	27	16	60	9	45	0	0	1	32	20	130	5	183	14	51	0	0	-1
947	0	0	12	42	15	153	4	81	8	114	13	64	0	0	-1
947	0	0	1	32	20	130	2	148	12	84	17	39	0	0	13	32	16	29	7	54	6	99	10	152	9	90	14	17	0	0	11	44	3	150	18	130	19	82	5	61	0	0	-1
947	0	0	8	114	0	0	-1