Inventory Routing Problem - Instances From Archetti et al. (2007)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
2	2	25	4	1	1875	61.22	17300.6	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	24	62	15	58	11	142	5	42	16	67	1	34	17	196	10	198	23	126	21	90	4	26	19	61	6	58	20	32	22	56	8	52	18	40	25	146	9	132	2	92	3	41	14	124	0	0	-1
1250	0	0	12	135	7	279	3	82	13	165	0	0	-1
1250	0	0	15	58	11	71	5	21	16	67	1	28	17	196	10	198	23	126	21	90	4	26	19	122	6	58	20	32	22	168	8	52	18	40	25	146	9	132	2	120	14	124	0	0	-1
1250	0	0	12	90	7	186	3	82	13	110	5	42	16	67	1	23	11	71	24	62	0	0	-1
1250	0	0	14	124	9	132	25	146	8	52	18	40	20	16	6	29	19	61	4	26	21	90	23	126	10	198	17	196	16	67	11	71	15	58	0	0	-1