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