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