Inventory Routing Problem - Instances From Archetti et al. (2012)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
1	6	50	5	4	974	345.01	14631.2	
r_0t	x_ijt	q_it	and_so_on
2598	-1
2598	0	0	33	74	50	192	32	158	0	0	8	10	40	66	24	194	16	74	2	34	15	190	29	192	17	64	30	112	23	38	0	0	47	26	22	88	36	16	12	26	42	192	20	70	13	39	4	54	31	104	44	114	26	72	45	166	0	0	19	66	27	55	34	80	7	84	25	168	10	102	6	170	5	28	46	12	18	48	38	86	9	53	0	0	-1
2598	0	0	9	106	47	13	38	43	36	32	12	13	48	210	42	96	20	140	13	78	49	129	37	98	0	0	41	183	23	19	30	56	43	213	35	225	28	81	32	79	0	0	17	32	46	24	10	51	6	85	5	56	39	117	14	51	25	84	7	168	34	160	27	110	19	33	0	0	8	20	40	33	1	63	24	97	21	150	29	96	15	95	3	189	11	195	0	0	-1
2598	0	0	26	72	44	114	31	104	4	54	37	294	50	192	33	74	0	0	-1
2598	0	0	43	71	11	125	18	48	38	86	22	88	36	32	12	13	48	70	42	96	20	140	13	78	49	43	4	27	44	57	0	0	45	166	32	158	50	96	28	27	35	75	9	106	47	26	17	64	30	112	23	38	41	106	0	0	29	192	15	190	3	67	46	24	10	102	6	85	5	56	39	39	14	17	25	168	2	34	0	0	19	66	21	58	16	74	27	110	7	168	34	160	24	194	1	21	40	66	8	20	33	37	0	0	-1
2598	-1