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