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	2	938	94.88	17929.2	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	4	26	19	61	6	58	20	32	22	56	8	52	18	40	25	146	9	132	2	106	3	82	14	124	0	0	24	31	15	58	11	71	5	42	16	67	1	34	17	196	10	198	23	126	21	90	0	0	-1
1250	0	0	12	135	7	279	14	62	13	165	11	142	15	29	0	0	-1
1250	0	0	3	82	2	106	9	132	25	146	18	40	8	52	22	168	20	32	6	58	4	26	21	90	0	0	19	183	23	126	10	198	17	196	1	34	16	67	5	21	24	62	0	0	-1
1250	0	0	12	90	7	186	14	124	13	110	5	42	16	134	17	98	11	71	15	58	0	0	-1
1250	0	0	4	26	6	29	20	16	18	40	8	52	25	146	9	132	3	82	0	0	21	90	23	126	10	198	1	34	11	71	15	29	24	31	0	0	-1