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	5	788	531.02	17790.9	
r_0t	x_ijt	q_it	and_so_on
2628	-1
2628	0	0	36	166	28	98	31	180	26	138	42	198	0	0	33	51	2	166	30	110	13	30	44	74	24	198	35	46	41	20	19	68	0	0	49	68	50	54	27	182	15	54	23	166	22	140	25	48	9	72	0	0	45	24	40	136	6	158	12	20	16	174	5	98	17	64	37	90	0	0	46	20	29	90	10	72	39	15	48	76	1	168	38	140	34	48	11	48	7	78	0	0	-1
2628	0	0	47	10	42	99	3	161	48	152	39	30	10	144	29	45	40	68	46	10	30	55	0	0	19	68	49	34	9	36	8	138	14	94	45	48	1	84	32	69	34	24	11	24	7	156	0	0	23	83	43	174	4	255	20	66	21	185	25	24	0	0	18	132	0	0	-1
2628	0	0	37	90	22	130	17	64	5	98	12	20	6	158	13	30	44	74	35	46	41	60	0	0	19	125	31	180	28	98	36	166	33	153	47	30	0	0	-1
2628	0	0	8	46	27	182	15	54	23	166	43	58	4	85	20	22	21	175	0	0	9	72	25	48	22	80	50	54	24	198	44	37	30	110	2	166	35	23	0	0	17	32	16	174	12	10	29	90	10	144	39	30	48	152	40	136	46	20	0	0	18	132	36	83	31	90	26	138	42	198	49	68	19	79	0	0	14	94	45	48	3	63	1	168	32	23	38	140	34	48	11	48	7	156	0	0	-1
2628	-1