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	3	1314	409.71	13392.8	
r_0t	x_ijt	q_it	and_so_on
2628	-1
2628	0	0	9	72	25	48	21	180	20	44	4	170	23	166	27	182	50	54	22	70	37	90	8	92	49	68	19	68	0	0	35	46	44	74	24	198	17	64	12	20	6	158	29	90	10	72	39	15	48	76	40	136	46	20	30	110	45	24	0	0	18	66	36	166	28	98	7	78	11	48	34	48	32	46	1	168	3	112	31	180	26	69	42	198	0	0	-1
2628	0	0	19	136	41	60	35	23	30	55	2	218	46	10	40	68	29	45	10	144	39	30	48	152	38	140	34	24	7	156	33	51	0	0	49	34	9	36	25	24	22	140	23	83	43	174	15	81	16	253	12	10	5	147	17	32	13	45	44	37	14	141	45	48	47	10	0	0	-1
2628	0	0	47	30	36	166	28	98	11	48	1	168	3	112	31	180	26	207	42	198	0	0	18	198	33	153	0	0	-1
2628	0	0	14	47	2	114	46	20	40	136	29	90	10	144	39	30	48	152	1	84	32	46	38	140	34	48	11	24	7	156	36	83	0	0	49	68	37	90	22	140	50	54	27	182	15	27	23	166	43	58	4	185	20	44	21	180	25	48	9	72	0	0	19	136	8	92	41	20	35	46	24	198	17	64	16	95	12	20	6	158	5	49	13	15	44	74	30	110	45	48	31	90	42	99	0	0	-1
2628	-1