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	1	1875	53.1	8788.34	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	12	90	3	82	7	186	2	106	9	132	25	146	18	40	8	52	22	56	20	32	6	58	19	61	4	26	21	90	23	126	10	198	17	139	1	34	5	21	11	142	15	58	0	0	-1
1250	0	0	14	186	3	41	13	110	5	42	16	134	17	155	24	93	0	0	-1
1250	0	0	12	90	7	186	2	106	9	66	25	146	8	52	22	168	18	40	20	32	6	58	19	183	4	26	21	45	23	126	10	198	1	34	11	142	15	58	0	0	-1
1250	0	0	8	26	9	132	3	82	14	124	13	110	5	42	16	134	17	196	21	90	0	0	-1
1250	0	0	24	31	15	58	11	71	1	34	10	198	23	126	4	26	6	29	20	16	18	40	25	146	0	0	-1