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	1	4	986	338.78	15542.4	
r_0t	x_ijt	q_it	and_so_on
2628	-1
2628	0	0	19	136	42	198	36	166	33	102	0	0	49	68	8	92	37	90	41	40	35	46	50	54	27	182	15	54	23	166	22	70	25	48	9	72	0	0	44	37	24	198	17	64	12	20	6	158	29	90	10	72	39	15	48	76	40	68	46	20	30	110	45	24	0	0	28	98	7	156	11	48	34	48	32	46	1	168	3	112	31	180	26	69	0	0	-1
2628	0	0	22	140	23	83	43	174	4	255	20	66	21	255	0	0	49	34	9	36	25	24	35	23	44	74	17	32	16	261	12	10	5	147	13	45	2	249	45	48	0	0	14	141	30	55	46	10	40	136	29	45	10	144	39	30	48	152	1	84	38	140	34	24	11	24	0	0	47	10	33	51	18	66	0	0	-1
2628	0	0	19	116	18	198	47	30	0	0	33	51	36	166	7	82	28	98	31	180	26	207	42	198	0	0	-1
2628	0	0	14	47	30	110	2	83	46	20	13	30	44	74	24	198	35	46	41	40	37	90	8	92	49	68	19	88	0	0	36	83	7	152	11	48	34	48	38	140	32	46	1	168	3	112	31	90	42	99	0	0	22	140	50	54	27	182	15	54	23	166	43	58	4	85	20	22	21	105	25	48	9	72	0	0	17	64	5	57	16	87	12	20	6	158	29	90	10	144	39	30	48	152	40	136	45	48	0	0	-1
2628	-1