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	1	45	1	1	3462	66.88	14797	
r_0t	x_ijt	q_it	and_so_on
2308	-1
2308	0	0	12	112	29	72	28	92	21	90	44	198	17	22	42	140	10	60	41	90	36	174	11	132	6	148	24	26	40	44	23	44	35	54	3	36	19	58	5	128	8	10	22	86	32	10	45	48	39	136	18	88	20	112	16	180	27	156	25	44	7	15	31	24	26	79	14	90	30	144	1	182	4	110	37	32	33	30	15	64	34	94	0	0	-1
2308	0	0	9	75	13	117	41	90	43	83	38	66	36	87	2	90	24	13	0	0	-1