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	15	5	5	217	24.19	12161	
r_0t	x_ijt	q_it	and_so_on
724	0	0	5	93	13	55	11	30	0	0	10	53	0	0	-1
724	0	0	8	172	0	0	2	194	14	23	0	0	4	80	6	26	3	72	1	39	0	0	15	73	9	144	0	0	-1
724	0	0	7	56	12	42	13	110	0	0	5	186	0	0	15	92	1	63	0	0	-1
724	0	0	12	14	11	90	14	41	4	46	6	26	0	0	8	172	0	0	10	159	0	0	3	72	9	144	0	0	2	194	0	0	-1
724	0	0	15	110	1	68	0	0	5	186	0	0	13	110	7	56	0	0	-1
724	0	0	4	42	6	26	3	36	9	72	0	0	8	86	2	97	0	0	-1