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	4	272	25.21	10257.7	
r_0t	x_ijt	q_it	and_so_on
724	-1
724	0	0	9	72	15	55	3	72	1	68	0	0	10	106	8	86	0	0	2	97	11	30	13	55	12	28	0	0	14	16	5	186	4	42	6	26	0	0	-1
724	0	0	13	110	0	0	2	194	0	0	15	110	9	144	0	0	7	75.066	8	172	0	0	-1
724	0	0	10	106	11	90	12	28	0	0	5	186	1	68	0	0	14	48	4	126	6	26	3	72	0	0	-1
724	0	0	9	144	15	110	0	0	2	194	1	34	0	0	8	172	7	36.933	0	0	13	110	5	93	6	13	3	36	0	0	-1
724	-1