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	5	375	99.26	20863.5	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	4	26	10	198	6	58	20	32	22	57	0	0	21	90	23	126	11	142	0	0	2	106	14	124	3	41	13	104	0	0	9	132	25	146	18	40	8	52	0	0	15	36	17	196	1	34	16	67	5	42	0	0	-1
1250	0	0	24	62	15	51	19	183	0	0	7	279	0	0	14	62	3	82	12	135	0	0	-1
1250	0	0	4	26	6	58	20	32	18	40	22	167	8	52	0	0	25	146	9	132	12	45	0	0	2	106	14	62	13	116	0	0	11	71	5	21	16	67	1	34	17	182	0	0	10	198	23	126	21	51	0	0	-1
1250	0	0	15	58	0	0	7	186	3	82	14	62	0	0	1	17	17	112	10	99	23	63	21	84	0	0	24	31	5	42	16	134	11	142	0	0	-1
1250	0	0	24	31	15	29	4	26	19	61	6	29	20	16	18	40	8	52	0	0	25	146	9	132	12	90	0	0	-1