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	20	1	5	330	59.45	13131.9	
r_0t	x_ijt	q_it	and_so_on
1101	-1
1101	0	0	20	116	4	90	13	94	0	0	12	40	9	42	8	55	2	182	0	0	19	80	18	88	0	0	7	15	11	102	14	144	15	46	0	0	17	142	3	182	0	0	-1
1101	0	0	16	128	4	45	2	91	1	36	12	20	0	0	19	160	0	0	10	251	7	30	0	0	5	261	0	0	3	91	6	117	8	110	0	0	-1
1101	0	0	5	87	14	144	15	46	9	42	0	0	13	94	11	102	0	0	18	264	0	0	-1
1101	0	0	13	47	14	72	15	23	3	182	0	0	4	90	2	182	1	18	12	40	0	0	7	30	19	160	0	0	17	213	10	117	0	0	16	44	20	116	8	110	9	21	6	39	0	0	-1
1101	-1