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	3	5	713	136.34	15809.4	
r_0t	x_ijt	q_it	and_so_on
2376	-1
2376	0	0	38	90	20	58	2	142	24	38	17	30	15	152	32	11	28	56	18	65	0	0	12	116	37	77	45	108	26	74	4	55	11	88	3	68	41	127	0	0	33	54	30	34	6	44	16	140	34	32	14	52	9	100	13	196	35	61	0	0	19	132	5	168	8	11	29	141	23	96	1	73	40	92	0	0	22	42	44	98	27	72	21	71	39	96	25	47	36	124	7	52	31	52	42	12	0	0	-1
2376	0	0	10	70	43	51	38	90	0	0	-1