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	30	1	4	691	189.76	28118.9	
r_0t	x_ijt	q_it	and_so_on
1842	-1
1842	0	0	29	198	0	0	30	54	3	76	21	34	26	67	2	24	5	112	27	64	9	166	10	87	0	0	11	176	8	55	20	168	1	68	19	53	18	60	14	88	0	0	15	102	4	82	7	112	13	104	24	112	25	178	0	0	-1
1842	0	0	23	204	12	297	18	120	0	0	29	99	6	264	25	89	0	0	4	41	22	47	17	177	5	56	27	128	16	91	28	99	0	0	-1
1842	0	0	15	102	17	59	10	87	9	166	16	273	0	0	11	176	8	165	20	168	23	68	19	53	0	0	4	41	22	47	2	12	26	201	21	17	3	38	13	104	30	54	24	112	0	0	25	89	14	264	0	0	-1
1842	0	0	18	120	19	106	12	198	28	66	1	102	11	88	0	0	25	89	24	56	6	176	7	112	22	94	4	41	15	51	0	0	29	198	0	0	30	27	3	76	21	34	2	24	5	112	27	128	9	83	10	174	0	0	-1
1842	-1