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