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	8	5	665	500.23	35588	
r_0t	x_ijt	q_it	and_so_on
2217	-1
2217	0	0	42	186	36	112	0	0	37	26	1	126	38	92	50	116	33	142	30	24	21	40	25	78	0	0	44	98	2	116	11	32	22	94	48	88	4	73	31	23	10	58	26	68	0	0	34	33	19	58	32	31	9	44	35	50	43	70	6	44	23	120	14	80	41	92	7	42	0	0	27	56	20	32	46	28	24	192	15	114	29	44	16	178	18	15	0	0	-1
2217	0	0	7	21	31	46	8	84	13	114	39	171	43	35	3	75	23	60	14	40	0	0	34	66	19	29	28	168	12	45	9	88	32	62	41	184	0	0	10	116	45	74	4	146	47	32	48	176	22	47	11	64	0	0	40	58	26	34	17	297	44	49	5	57	49	26	0	0	-1
2217	0	0	36	112	37	78	5	171	42	186	49	78	0	0	18	45	16	178	15	114	24	192	46	28	20	32	27	56	0	0	1	126	38	92	50	116	33	142	30	24	21	20	29	44	25	78	0	0	-1
2217	0	0	49	0	42	93	27	0	46	14	16	89	24	96	15	57	29	22	21	40	25	39	38	46	1	63	44	98	0	0	7	21	31	46	8	28	13	114	39	114	43	70	3	25	6	44	23	120	14	53	0	0	34	66	19	58	28	112	12	15	35	75	9	88	32	62	41	184	0	0	17	99	2	116	11	64	10	116	40	58	26	68	36	56	0	0	30	12	33	71	50	58	22	94	48	176	47	32	4	146	45	74	0	0	-1
2217	-1