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