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	25	2	3	618	132.65	20427.8	
r_0t	x_ijt	q_it	and_so_on
1236	-1
1236	0	0	21	54	23	162	6	19	18	15	25	82	8	36	2	152	3	50	1	13	0	0	13	64	15	64	5	30	16	166	24	81	19	70	12	27	4	112	0	0	22	156	17	108	11	170	20	116	0	0	-1
1236	0	0	24	49	0	0	3	25	7	248	11	85	10	162	17	54	0	0	14	108	18	30	6	38	9	216	2	76	1	26	20	58	0	0	-1
1236	0	0	5	30	16	166	24	130	19	70	22	78	12	81	4	56	0	0	15	192	13	32	0	0	-1
1236	0	0	14	72	18	30	9	116	25	82	8	36	10	54	11	170	20	58	0	0	4	112	22	156	17	108	19	35	16	83	13	64	0	0	1	26	3	50	7	136	2	152	6	38	23	162	21	54	0	0	-1
1236	0	0	5	30	24	65	0	0	-1