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