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	40	3	5	657	113.6	4977.14	
r_0t	x_ijt	q_it	and_so_on
2189	-1
2189	0	0	36	70	40	58	4	96	23	34	2	37	16	53	9	153	21	102	14	54	0	0	15	69	39	66	18	34	26	22	19	190	24	55	33	98	17	122	0	0	11	96	35	152	29	114	13	14	30	70	27	52	32	116	28	22	1	21	0	0	22	44	38	130	3	33	37	15	6	94	8	156	25	84	34	52	5	37	0	0	10	42	20	118	31	176	12	126	7	122	0	0	-1
2189	0	0	11	96	0	0	-1