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	2	3	430	38.19	7492.23	
r_0t	x_ijt	q_it	and_so_on
861	-1
861	0	0	10	63	13	10	14	60	15	88	3	184	0	0	11	72	12	166	7	142	0	0	4	132	1	55	9	68	0	0	-1
861	0	0	3	92	1	110	8	132	4	96	0	0	5	291	0	0	14	30	15	50	2	297	6	33	13	20	0	0	-1
861	0	0	11	72	12	166	10	189	0	0	-1
861	0	0	9	68	1	110	8	100	4	152	0	0	3	184	12	83	11	36	5	97	0	0	14	60	15	92	2	105	6	11	13	20	7	142	0	0	-1
861	-1