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	4	2	1109	138.41	18742	
r_0t	x_ijt	q_it	and_so_on
1479	-1
1479	0	0	24	17	9	64	23	126	15	168	19	93	10	96	29	198	13	182	11	55	14	106	0	0	20	39	4	92	27	98	30	158	25	116	8	22	18	64	12	198	28	13	16	64	2	42	5	15	1	32	6	53	3	64	0	0	-1
1479	0	0	17	87	26	60	7	51	6	106	1	16	22	140	5	30	21	123	16	128	28	26	12	99	18	32	25	58	30	79	27	49	0	0	4	46	20	78	0	0	-1
1479	0	0	24	51	9	64	23	126	15	168	19	279	10	96	29	198	0	0	14	106	11	165	13	182	17	29	26	180	3	64	0	0	-1
1479	0	0	28	26	12	198	18	64	8	33	25	116	30	158	15	84	23	63	10	48	29	99	13	91	14	53	0	0	3	32	7	34	6	106	1	32	22	140	5	30	21	82	16	128	2	63	27	98	4	92	20	78	0	0	-1
1479	-1