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	2	938	85.44	9370.18	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	19	122	6	58	23	126	10	198	17	196	1	17	5	21	11	142	15	58	0	0	3	72	7	186	2	106	9	132	25	146	18	40	8	52	22	56	20	32	4	26	21	90	0	0	-1
1250	0	0	12	135	14	186	3	51	13	165	5	42	16	134	1	34	15	29	24	62	0	0	-1
1250	0	0	21	90	23	126	10	198	17	196	11	71	0	0	12	45	7	186	2	106	9	132	25	146	18	40	8	52	22	112	20	16	6	58	4	26	0	0	-1
1250	0	0	15	58	11	142	1	34	16	134	5	42	13	55	3	82	14	124	25	73	18	20	20	32	19	122	4	13	0	0	24	62	0	0	-1
1250	0	0	21	45	23	126	17	196	10	198	6	29	22	56	8	52	9	66	0	0	-1