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	2	646	52.61	6577.95	
r_0t	x_ijt	q_it	and_so_on
861	-1
861	0	0	3	184	1	110	8	58	9	34	4	152	0	0	14	60	15	92	2	198	6	11	10	63	13	20	12	83	11	72	0	0	-1
861	0	0	7	210	12	166	5	194	0	0	-1
861	0	0	3	184	1	55	8	174	9	102	4	76	0	0	7	74	14	60	15	46	2	198	6	33	13	10	10	189	11	36	0	0	-1
861	0	0	13	20	14	30	15	92	1	110	4	152	3	92	0	0	12	166	11	72	5	194	0	0	-1
861	-1