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	4	469	102.76	11062	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	8	52	22	112	18	40	20	32	6	58	4	26	21	90	0	0	15	55	5	21	1	34	17	98	10	198	23	63	0	0	25	146	9	132	7	186	0	0	12	45	2	83	14	62	3	82	13	55	11	142	0	0	-1
1250	0	0	23	126	19	95	0	0	15	32	17	196	16	134	5	42	24	62	0	0	-1
1250	0	0	14	186	3	82	13	165	15	29	0	0	25	146	9	132	2	129	12	62	0	0	4	26	19	149	6	58	20	32	18	40	22	112	8	52	0	0	11	142	1	34	10	198	21	90	0	0	-1
1250	0	0	24	62	5	42	16	134	17	196	0	0	23	126	0	0	7	279	12	118	0	0	-1
1250	0	0	3	82	9	66	25	146	8	52	18	40	20	16	6	29	4	26	0	0	21	90	10	198	1	34	11	71	15	58	0	0	-1