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	1	2535	74.41	7945.9	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	11	154	13	190	29	198	30	88	8	20	15	92	12	99	28	112	10	148	7	13	1	116	22	170	4	73	20	138	16	82	18	42	2	30	27	58	14	152	21	50	5	24	6	76	3	131	24	13	23	36	19	192	17	38	0	0	-1
1690	0	0	17	19	19	96	23	72	24	26	3	67	6	152	26	70	14	76	27	29	9	132	28	56	12	198	25	237	0	0	-1
1690	0	0	7	39	1	116	22	170	4	81	16	246	15	276	8	20	30	88	29	198	13	190	11	154	0	0	-1
1690	0	0	8	10	30	44	29	99	11	77	13	95	17	38	19	192	23	72	24	26	3	132	6	152	5	24	21	50	26	70	14	152	9	132	27	58	2	45	18	42	22	85	4	138	20	207	1	58	10	148	28	112	12	198	25	79	0	0	-1
1690	-1