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	3	625	107.23	9832.51	
r_0t	x_ijt	q_it	and_so_on
1250	-1
1250	0	0	15	58	23	126	4	26	19	61	6	58	20	32	18	40	22	112	8	52	0	0	3	55	7	186	2	106	9	132	25	146	0	0	11	142	5	42	16	67	1	34	17	98	10	197	21	45	0	0	-1
1250	0	0	12	135	14	186	3	68	13	165	0	0	24	62	17	196	10	100	23	63	21	90	0	0	-1
1250	0	0	15	58	1	34	16	201	5	21	11	71	0	0	25	146	9	132	2	106	7	186	12	45	0	0	4	26	19	183	6	29	20	16	18	40	22	112	8	52	0	0	-1
1250	0	0	8	26	18	20	20	32	6	58	4	13	23	126	21	90	0	0	24	62	13	55	3	82	14	124	0	0	15	29	11	142	5	42	1	17	17	196	10	198	0	0	-1
1250	0	0	9	66	25	146	0	0	-1