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	3	473	69.08	16532.6	
r_0t	x_ijt	q_it	and_so_on
947	-1
947	0	0	20	65	11	44	3	150	18	71	19	82	5	61	0	0	10	152	6	120	7	54	16	40	9	90	14	17	0	0	13	64	8	114	4	54	15	102	12	42	17	26	0	0	-1
947	0	0	12	84	2	213	20	130	1	16	0	0	-1
947	0	0	19	82	18	189	3	75	11	44	2	83	0	0	1	48	14	51	5	61	13	64	8	114	0	0	9	90	6	276	7	54	16	40	0	0	-1
947	0	0	3	150	11	88	20	130	0	0	19	41	10	228	7	27	9	45	5	122	0	0	4	54	15	102	12	84	17	39	0	0	-1
947	0	0	8	114	13	64	0	0	-1