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