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	3	362	36.9	8339.19	
r_0t	x_ijt	q_it	and_so_on
724	-1
724	0	0	5	186	2	97	13	55	12	24	0	0	10	106	7	56	8	172	0	0	1	34	3	72	6	26	15	55	9	144	0	0	-1
724	0	0	15	110	4	84	14	16	1	68	0	0	13	110	11	30	2	194	0	0	-1
724	0	0	10	106	0	0	8	172	11	90	12	32	0	0	9	72	3	72	6	26	5	136	14	48	0	0	-1
724	0	0	7	56	13	110	2	194	0	0	8	86	5	143	4	84	6	13	3	36	0	0	1	68	15	110	9	144	0	0	-1
724	-1