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	1	30	3	1	2841	32.72	3814.4	
r_0t	x_ijt	q_it	and_so_on
1894	-1
1894	0	0	10	122	6	64	11	66	9	98	27	168	21	66	1	82	20	108	14	130	17	138	24	60	22	64	8	55	29	198	7	120	15	43	5	57	13	96	12	99	28	160	4	48	3	54	18	142	25	68	2	98	30	122	0	0	-1
1894	0	0	16	219	26	92	23	95	19	150	30	61	0	0	-1