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	1	1854	63.26	7328.76	
r_0t	x_ijt	q_it	and_so_on
1236	-1
1236	0	0	13	64	15	64	4	112	5	30	16	166	24	67	19	70	22	156	17	108	10	108	11	170	2	152	3	50	6	38	18	30	14	72	1	26	20	116	0	0	-1
1236	0	0	4	56	12	81	24	128	5	15	16	83	19	35	22	78	17	54	11	85	8	54	7	288	2	76	9	244	25	123	18	15	6	19	21	81	23	243	3	25	1	13	20	58	0	0	-1
1236	0	0	13	64	15	192	0	0	-1
1236	0	0	20	58	1	26	23	81	21	27	14	72	18	30	6	38	3	50	7	96	2	152	9	88	25	41	8	18	11	170	10	108	17	108	22	156	19	70	24	130	16	166	5	30	12	27	4	112	0	0	-1
1236	0	0	13	32	0	0	-1