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