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	1	4	986	651.81	35979.6	
r_0t	x_ijt	q_it	and_so_on
2628	-1
2628	0	0	18	66	36	144.24	7	156	28	98	31	180	42	198	0	0	47	0	33	0	11	48	34	48	38	70	32	46	1	168	3	56	46	20	2	83	30	110	44	37	35	46	41	20	37	90	49	68	19	68	0	0	8	46	50	54	27	182	15	54	23	166	43	58	4	170	20	44	21	90	25	48	9	72	0	0	22	140	17	64	12	20	6	158	29	90	10	144	39	30	48	152	40	136	45	48	0	0	-1
2628	0	0	14	94	44	74	13	45	5	147	12	10	16	174	17	32	24	297	35	23	0	0	47	10	33	153	36	104.76	26	138	42	99	19	136	0	0	-1
2628	0	0	42	99	31	90	3	168	1	168	38	210	34	48	11	48	7	78	18	66	47	10	0	0	41	20	35	23	23	166	43	174	4	170	20	44	21	270	22	70	25	48	0	0	49	68	9	72	8	46	30	110	2	249	46	20	40	136	29	90	10	72	39	15	48	76	45	24	0	0	-1
2628	0	0	44	74	13	30	5	98	6	237	12	20	16	174	17	64	24	198	35	23	41	40	0	0	7	156	11	24	34	24	32	46	1	84	48	152	39	30	10	144	29	45	40	68	46	10	30	55	14	94	45	48	0	0	18	132	36	166	28	147	31	180	26	138	42	99	33	102	47	20	0	0	9	36	25	24	22	140	23	83	15	81	27	182	50	54	37	90	8	92	49	34	19	136	0	0	-1
2628	-1