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