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	10	3	4	178	12.27	8097.66	
r_0t	x_ijt	q_it	and_so_on
475	0	0	3	11	6	99	2	61	0	0	-1
475	0	0	1	74	7	78	8	21	0	0	9	64	4	55	5	28	0	0	10	160	0	0	-1
475	0	0	2	122	8	42	0	0	6	147	0	0	-1
475	0	0	4	55	3	33	9	64	0	0	7	78	0	0	1	178	0	0	6	150	5	28	0	0	-1
475	0	0	2	122	8	42	0	0	10	160	0	0	4	110	0	0	-1
475	0	0	5	14	6	99	0	0	-1