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	30	1	4	691	138.14	12953.1	
r_0t	x_ijt	q_it	and_so_on
1842	-1
1842	0	0	1	68	16	182	9	166	27	128	5	112	2	24	0	0	29	198	0	0	30	54	3	38	21	17	7	112	22	94	4	82	15	102	14	176	0	0	11	176	12	198	23	136	18	120	0	0	-1
1842	0	0	24	168	19	53	28	99	20	252	8	55	0	0	6	264	25	267	0	0	30	27	13	156	3	76	21	34	26	201	2	12	4	41	15	51	0	0	17	177	5	56	27	64	9	83	10	261	0	0	-1
1842	0	0	18	120	19	159	1	68	8	165	11	176	0	0	29	198	0	0	-1
1842	0	0	4	82	22	94	7	112	17	100.733	2	24	26	67	21	34	3	76	13	52	0	0	29	99	24	56	6	88	30	54	15	102	14	176	25	89	0	0	5	112	10	87	9	166	27	128	16	182	0	0	18	60	23	136	12	198	28	33	20	84	11	88	0	0	-1
1842	-1