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	4	464	118.83	11583.8	
r_0t	x_ijt	q_it	and_so_on
1236	-1
1236	0	0	22	156	17	108	11	170	1	26	0	0	18	30	6	38	2	152	7	192	3	50	0	0	5	30	16	166	24	129.96	19	70	12	54	0	0	13	64	15	128	4	112	0	0	-1
1236	0	0	18	15	25	123	9	249	2	76	0	0	14	108	21	81	6	19	23	243	0	0	20	58	22	78	19	35	24	65.04	16	83	5	15	0	0	1	0	3	25	7	96	8	54	10	145.48	17	54	11	85	4	0	0	0	-1
1236	0	0	20	174	1	26	4	112	0	0	13	64	15	128	0	0	-1
1236	0	0	4	56	22	156	11	170	0	0	21	27	23	81	6	38	2	152	7	96	3	50	1	13	0	0	19	70	17	108	10	70.52	8	18	25	41	9	83	18	30	14	36	0	0	12	54	24	130	16	166	5	30	13	32	0	0	-1
1236	-1