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