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	20	2	5	334	60.8	18350.9	
r_0t	x_ijt	q_it	and_so_on
1112	-1
1112	0	0	19	120	16	154	0	0	7	42	14	88	15	37	5	145	8	22	0	0	9	33	11	184	6	69	0	0	3	166	10	168	0	0	2	166	18	76	0	0	-1
1112	0	0	6	69	11	92	4	81	9	66	0	0	17	126	18	152	12	31	0	0	20	48	13	168	1	14	16	77	0	0	-1
1112	0	0	10	84	15	111	14	88	7	21	0	0	3	166	0	0	5	151	4	159	0	0	17	42	1	42	2	166	20	16	8	11	0	0	6	69	19	120	12	65	0	0	-1
1112	0	0	6	138	13	168	8	22	0	0	18	152	16	154	12	28	0	0	3	83	0	0	14	44	7	42	10	168	0	0	9	66	4	84	11	184	0	0	-1
1112	-1