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	20	1	3	550	82.98	17424.3	
r_0t	x_ijt	q_it	and_so_on
1101	0	0	19	80	0	0	-1
1101	0	0	16	43	20	62	4	90	2	182	1	24	8	110	6	39	0	0	7	15	10	92	17	142	11	102	13	94	0	0	5	96	14	144	15	46	9	42	3	182	12	40	0	0	-1
1101	0	0	7	30	19	160	18	176	0	0	-1
1101	0	0	10	92	11	102	17	142	0	0	6	39	9	21	8	55	2	91	4	45	20	170	16	129	0	0	13	49	5	252	14	72	15	46	3	91	12	40	0	0	-1
1101	0	0	13	92	14	144	15	23	3	182	0	0	12	20	6	78	9	42	8	110	1	28	2	182	4	90	0	0	18	176	19	160	7	30	10	184	0	0	-1
1101	-1