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	2	30	2	5	507	141.65	12478.1	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	20	138	16	164	22	85	1	116	0	0	29	198	30	88	8	20	0	0	11	154	13	190	17	38	0	0	19	192	23	72	28	112	12	99	0	0	24	13	6	76	26	70	14	152	27	58	9	132	0	0	-1
1690	0	0	28	56	14	76	27	29	2	45	18	42	22	170	4	73	0	0	21	50	5	36	6	152	3	198	24	26	23	36	0	0	10	148	7	39	15	276	30	44	0	0	12	198	25	158	0	0	-1
1690	0	0	29	198	11	154	0	0	13	167	17	38	19	192	0	0	1	93	4	219	20	138	8	20	0	0	-1
1690	0	0	10	148	12	198	25	158	0	0	15	92	16	164	22	170	1	81	0	0	8	10	30	88	29	99	11	77	13	118	17	19	19	96	0	0	23	72	24	26	3	83	6	152	5	12	21	50	28	112	0	0	26	70	14	152	9	132	27	58	2	30	18	42	7	13	0	0	-1
1690	-1