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