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