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