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