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	50	1	4	911	177.71	5869	
r_0t	x_ijt	q_it	and_so_on
2430	-1
2430	0	0	49	68	37	45	22	140	50	27	27	91	15	54	23	166	43	58	4	26	20	26	21	90	25	48	9	72	0	0	45	48	3	22	40	136	6	79	12	20	16	87	5	44	17	64	24	99	44	74	13	16	30	110	35	46	41	20	8	46	0	0	14	47	2	18	46	20	29	90	10	144	39	30	48	152	1	168	32	23	38	70	34	48	11	48	28	53	0	0	19	136	42	198	26	69	31	180	7	156	36	166	0	0	-1
2430	0	0	47	10	33	51	18	66	0	0	-1