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	2	5	371	101.1	13302.9	
r_0t	x_ijt	q_it	and_so_on
1236	-1
1236	0	0	20	116	1	13	3	50	11	170	0	0	2	152	9	166	18	15	6	19	0	0	4	112	15	64	13	64	0	0	5	30	16	112	24	65	22	156	0	0	12	54	19	70	17	108	10	108	0	0	-1
1236	0	0	14	108	18	30	25	123	8	54	3	25	1	26	0	0	23	243	6	38	21	81	0	0	5	15	16	137	24	130	19	35	17	54	0	0	7	288	2	76	0	0	-1
1236	0	0	4	56	22	99	11	170	0	0	20	116	15	192	13	51	0	0	-1
1236	0	0	24	130	16	166	5	30	13	45	0	0	3	50	8	18	10	108	17	108	11	85	0	0	23	81	2	152	7	96	1	26	0	0	21	27	6	38	9	166	25	41	18	30	14	69	0	0	4	112	22	135	19	70	12	54	0	0	-1
1236	-1