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