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	5	371	110.39	23161.5	
r_0t	x_ijt	q_it	and_so_on
1236	-1
1236	0	0	1	13	2	152	8	36	25	82	18	15	6	19	21	54	0	0	11	131.6	3	50	23	162	0	0	5	30	16	166	24	130	0	0	13	64	15	64	4	112	20	116	0	0	22	78	17	108	19	70	12	54	0	0	-1
1236	0	0	2	76	7	288	0	0	14	108	18	30	9	181.4	6	38	0	0	1	26	22	156	19	35	5	15	0	0	17	54	10	162	11	123.4	3	25	0	0	-1
1236	0	0	4	112	15	192	0	0	13	64	16	166	24	130	0	0	-1
1236	0	0	21	54	23	162	20	116	0	0	12	54	22	156	19	70	5	30	0	0	17	108	10	54	11	170	0	0	3	50	7	96	8	36	25	82	18	30	14	72	0	0	1	26	2	152	9	150.6	6	38	0	0	-1
1236	0	0	13	32	16	166	24	65	4	56	0	0	-1