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