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	4	1	2218	80.42	7527.15	
r_0t	x_ijt	q_it	and_so_on
1479	-1
1479	0	0	20	78	4	92	27	98	24	17	9	32	11	110	13	91	29	198	10	96	19	93	15	168	23	126	30	158	25	116	8	22	18	64	12	198	28	26	16	128	21	41	2	42	5	30	22	70	1	32	6	53	3	39	0	0	-1
1479	0	0	3	57	6	106	7	51	26	120	17	87	13	182	14	159	0	0	-1
1479	0	0	1	32	22	210	5	15	21	123	16	64	28	13	12	198	18	64	8	22	25	116	30	79	15	168	19	279	10	96	29	198	23	126	9	96	24	51	27	98	4	92	20	39	0	0	-1
1479	0	0	3	64	1	16	6	106	7	34	26	120	17	58	14	106	13	182	11	110	29	99	10	48	23	63	15	84	30	158	25	58	18	32	12	99	28	26	16	128	2	63	5	30	4	46	20	78	27	49	0	0	-1
1479	-1