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