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	10	3	4	178	18.2	11933.8	
r_0t	x_ijt	q_it	and_so_on
475	0	0	9	32	10	80	0	0	3	11	6	99	2	61	0	0	-1
475	0	0	5	28	7	78	8	42	0	0	-1
475	0	0	1	126	0	0	4	110	0	0	6	178	0	0	8	21	2	122	0	0	-1
475	0	0	10	178	0	0	5	14	6	119	3	33	0	0	9	96	7	78	0	0	-1
475	0	0	5	28	6	99	0	0	2	122	8	42	0	0	1	126	0	0	10	62	4	110	0	0	-1
475	-1