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	15	5	5	217	31.11	17369.5	
r_0t	x_ijt	q_it	and_so_on
724	0	0	15	55	6	13	2	97	7	28	0	0	-1
724	0	0	8	86	13	110	0	0	5	186	0	0	14	32	4	84	3	36	1	34	0	0	9	144	0	0	-1
724	0	0	10	159	0	0	1	68	15	110	0	0	2	194	0	0	8	172	0	0	3	72	6	26	12	28	11	90	0	0	-1
724	0	0	5	186	0	0	9	144	0	0	7	84	13	110	0	0	-1
724	0	0	14	32	4	84	6	26	3	72	0	0	10	106	0	0	8	172	12	28	0	0	15	110	1	68	0	0	2	194	0	0	-1
724	0	0	11	30	13	55	5	93	0	0	9	72	0	0	-1