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	
1	2	25	4	5	375	90.59	12404.2	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	2	106	3	82	14	124	0	0	15	58	11	71	23	126	21	90	0	0	8	52	22	56	18	40	20	32	6	58	19	61	4	26	0	0	25	146	9	132	12	90	0	0	5	42	16	67	1	34	17	133	10	99	0	0	-1
1250	0	0	12	45	7	279	0	0	13	165	11	142	23	63	0	0	17	161	10	198	0	0	24	62	0	0	-1
1250	0	0	22	168	20	32	6	58	4	26	0	0	21	90	23	63	19	183	0	0	8	52	18	40	25	146	9	132	0	0	12	45	2	106	3	82	14	124	0	0	15	58	1	34	16	201	5	21	0	0	-1
1250	0	0	15	29	11	142	10	198	0	0	5	42	1	17	17	196	23	63	21	45	0	0	7	186	14	62	13	55	24	62	0	0	-1
1250	0	0	9	66	25	146	8	52	18	40	20	16	6	29	4	26	0	0	12	90	3	82	0	0	-1