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	4	413	64.61	10836.8	
r_0t	x_ijt	q_it	and_so_on
1101	0	0	19	80	0	0	-1
1101	0	0	3	182	6	39	9	42	8	110	12	40	0	0	1	24	2	182	4	90	20	74	16	43	0	0	7	15	10	92	17	142	11	70	13	94	0	0	5	174	14	144	15	46	0	0	-1
1101	0	0	7	30	19	160	18	176	0	0	-1
1101	0	0	14	93	15	23	3	91	6	39	9	21	8	55	2	91	0	0	16	129	20	158	4	82	1	24	12	20	0	0	10	276	0	0	13	94	11	134	17	142	0	0	-1
1101	0	0	4	53	2	182	8	110	7	30	0	0	18	176	19	160	0	0	5	243	14	123	13	47	0	0	15	46	9	42	6	103	3	182	12	40	0	0	-1
1101	-1