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	4	272	31.6	15279.3	
r_0t	x_ijt	q_it	and_so_on
724	-1
724	0	0	9	144	15	110	0	0	13	55	12	14	8	172	0	0	2	194	11	60	0	0	5	93	4	42	6	26	3	72	1	34	0	0	-1
724	0	0	7	84	13	110	15	55	0	0	14	32	5	186	6	13	1	34	0	0	10	159	0	0	-1
724	0	0	12	42	2	194	0	0	9	72	3	36	4	126	1	34	0	0	10	53	8	86	0	0	-1
724	0	0	6	26	5	186	14	32	0	0	9	144	0	0	8	86	11	60	13	110	0	0	1	68	3	72	15	110	0	0	-1
724	0	0	7	28	8	86	2	97	0	0	-1