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