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