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	4	4	852	128.53	15665.5	
r_0t	x_ijt	q_it	and_so_on
2271	-1
2271	0	0	40	116	32	24	14	122	18	106	27	30	10	62	43	70	25	120	38	57	41	120	0	0	4	10	26	16	21	61	28	128	3	84	45	138	44	193	13	74	6	86	7	62	0	0	39	128	33	33	31	132	35	156	9	83	37	198	2	122	0	0	30	81	20	14	36	98	15	196	42	73	5	98	1	128	34	70	8	22	24	44	12	28	0	0	-1
2271	0	0	25	60	26	16	23	183	19	25	17	51	44	101	29	81	22	54	34	140	16	60	11	54	0	0	-1