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	3	618	127.93	10030.8	
r_0t	x_ijt	q_it	and_so_on
1236	-1
1236	0	0	14	72	18	30	25	64	8	36	10	54	17	108	11	170	1	26	20	58	0	0	13	32	15	85	5	15	16	83	24	65	19	70	22	156	4	112	0	0	3	50	7	104	2	152	9	166	6	38	23	81	21	27	0	0	-1
1236	0	0	13	64	15	43	5	30	16	166	24	130	12	81	0	0	-1
1236	0	0	14	72	21	81	23	243	1	13	20	174	0	0	12	27	19	70	17	108	10	162	11	117	22	78	4	56	0	0	3	25	2	143	7	280	8	36	25	100	18	15	6	19	0	0	-1
1236	0	0	20	58	1	26	3	50	11	138	2	85	9	166	18	30	6	38	0	0	22	156	17	54	19	35	24	130	16	166	5	30	0	0	4	112	15	128	13	64	0	0	-1
1236	-1