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	3	237	12.74	10700	
r_0t	x_ijt	q_it	and_so_on
475	-1
475	0	0	5	28	2	87	0	0	1	63	7	78	8	42	0	0	3	22	6	198	0	0	-1
475	0	0	9	96	0	0	10	237	0	0	4	120	2	96	8	21	0	0	-1
475	0	0	5	26	6	198	0	0	1	189	0	0	-1
475	0	0	4	100	3	22	9	32	10	83	0	0	2	122	6	99	5	16	0	0	7	117	8	42	0	0	-1
475	-1