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