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	5	284	59.76	19757.1	
r_0t	x_ijt	q_it	and_so_on
947	-1
947	0	0	1	32	20	130	9	90	0	0	19	82	10	152	16	40	0	0	13	64	8	114	0	0	6	198	7	54	0	0	17	26	12	84	3	150	0	0	-1
947	0	0	2	148	0	0	11	88	18	195	0	0	14	34	5	61	9	45	7	27	19	41	0	0	13	32	8	57	4	54	15	102	0	0	-1
947	0	0	16	40	6	198	9	45	0	0	5	183	0	0	17	26	12	42	3	150	20	65	0	0	-1
947	0	0	9	45	7	54	10	152	1	32	0	0	13	64	8	114	0	0	4	54	15	102	12	84	0	0	2	148	20	130	0	0	11	88	18	65	19	82	14	34	0	0	-1
947	0	0	3	75	0	0	-1