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	2	30	2	5	507	159.95	24647.4	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	1	58	16	164	15	184	8	10	30	88	0	0	11	154	13	95	29	198	0	0	25	158	19	192	17	38	0	0	12	99	5	24	6	152	3	132	24	26	23	72	0	0	28	112	14	152	27	58	2	30	18	42	22	85	7	13	0	0	-1
1690	0	0	28	56	21	50	26	70	14	76	27	29	9	132	10	74	0	0	1	58	22	85	4	73	20	207	0	0	8	20	30	44	29	99	11	77	13	190	17	19	0	0	12	198	0	0	-1
1690	0	0	16	164	4	219	20	69	0	0	5	24	6	76	3	132	24	13	23	51	19	192	0	0	22	85	1	114	7	39	10	222	0	0	-1
1690	0	0	11	154	13	190	17	38	19	96	0	0	21	50	14	152	26	70	6	152	24	26	23	57	0	0	29	198	30	88	8	20	15	184	0	0	1	60	22	170	18	42	2	45	27	58	9	132	0	0	12	198	28	112	25	158	0	0	-1
1690	-1