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	2	3	430	35.5	15507.8	
r_0t	x_ijt	q_it	and_so_on
861	-1
861	0	0	14	60	6	11	2	198	15	92	0	0	11	72	12	83	13	20	10	63	0	0	3	184	1	55	8	79	4	76	0	0	-1
861	0	0	9	102	1	110	4	152	0	0	5	291	3	92	0	0	7	181	12	166	0	0	-1
861	0	0	10	189	13	20	11	72	0	0	14	60	15	92	6	33	8	153	3	92	0	0	-1
861	0	0	5	194	12	166	0	0	7	103	14	30	2	297	0	0	3	92	1	110	4	76	0	0	-1
861	0	0	11	72	13	10	14	30	15	46	4	76	9	34	0	0	-1