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	2	3	1310	353.43	14109	
r_0t	x_ijt	q_it	and_so_on
2620	-1
2620	0	0	5	89	32	74	36	66	26	76	50	88	12	22	48	52	43	32	39	42	4	70	10	44	40	37	46	22	8	82	2	134	49	118	45	39	15	44	27	164	0	0	7	114	9	126	18	66	44	128	11	76	33	184	25	78	24	198	0	0	47	22	13	21	37	162	34	76	41	60	35	36	38	82	28	178	6	58	31	160	42	196	22	82	1	68	3	26	19	74	0	0	-1
2620	0	0	19	37	45	78	40	74	20	102	29	240	4	140	10	88	23	201	48	104	16	222	0	0	27	82	15	88	14	255	30	30	2	67	8	164	21	160	3	13	17	162	0	0	-1
2620	0	0	47	11	24	99	33	92	5	267	42	196	36	198	11	76	44	128	9	126	7	114	0	0	18	33	13	63	37	162	41	30	35	108	28	178	6	174	31	160	26	38	12	22	50	88	22	41	1	104.2	17	54	0	0	-1
2620	0	0	19	74	45	78	30	20	46	22	40	74	20	68	29	160	10	88	4	140	39	63	43	48	23	67	48	104	16	74	22	82	1	99.8	0	0	7	57	9	63	34	76	41	60	38	82	28	89	31	80	12	11	50	44	26	76	42	98	32	111	11	38	33	184	25	78	18	66	0	0	27	164	15	88	14	170	49	118	2	134	8	164	21	160	3	26	17	54	24	198	47	22	0	0	-1
2620	-1