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