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	
2	6	50	5	5	779	501.86	36184.5	
r_0t	x_ijt	q_it	and_so_on
2598	-1
2598	0	0	27	55	34	80	7	84	25	168	10	102	6	170	5	28	46	24	18	48	0	0	33	74	8	10	40	66	24	194	19	66	16	74	17	64	30	56	23	19	41	122	0	0	32	158	50	192	31	104	44	114	26	72	45	83	0	0	4	54	49	86	13	78	20	140	42	192	48	70	12	13	36	32	22	88	0	0	29	192	15	190	38	86	47	26	9	106	35	150	0	0	-1
2598	0	0	41	61	11	160	3	128	6	85	5	56	39	117	14	34	25	84	19	33	8	20	0	0	21	150	2	17	27	110	7	168	34	160	24	97	1	42	40	33	0	0	33	37	0	0	23	19	30	112	17	32	43	142	35	75	37	196	28	27	50	96	32	79	0	0	-1
2598	0	0	13	39	20	70	42	192	48	210	12	39	36	31.8	47	26	9	53	35	75	28	27	0	0	23	38	17	32	29	192	2	51	15	190	10	102	46	24	18	48	38	86	0	0	45	249	44	114	31	104	4	27	50	96	32	79	41	61	33	37	0	0	-1
2598	0	0	32	79	50	96	37	196	35	75	9	106	43	142	0	0	47	13	38	43	46	12	10	51	6	170	5	56	39	78	14	34	25	168	16	74	19	66	0	0	8	20	40	66	1	42	24	194	34	160	7	168	27	110	0	0	33	37	21	100	29	96	15	95	3	128	11	160	17	32	30	112	23	19	0	0	26	72	44	57	4	54	49	86	13	78	20	140	42	96	36	16.2	22	88	28	54	0	0	-1
2598	-1