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