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	2	5	634	144.36	15575.6	
r_0t	x_ijt	q_it	and_so_on
2114	-1
2114	0	0	9	82	13	136	27	114	41	80	36	148	26	58	0	0	30	66	1	82	22	77	15	108	42	41	5	29	34	85	8	20	29	126	0	0	39	37	18	76	37	108	31	76	7	40	25	35	4	20	12	24	20	24	14	160	40	34	0	0	38	66	10	20	43	67	21	80	19	17	3	26	44	154	35	44	16	160	0	0	24	32	11	32	2	160	45	78	17	26	23	70	28	124	32	22	6	48	33	42	0	0	-1
2114	-1