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	10	4	1	766	17.65	4823.53	
r_0t	x_ijt	q_it	and_so_on
511	0	0	9	99	0	0	-1
511	0	0	9	17	7	38	5	75	1	102	3	24	8	110	10	86	2	156	4	20	6	138	0	0	-1
511	-1
511	0	0	6	69	4	20	2	156	10	86	3	24	1	102	5	75	7	38	9	196	0	0	-1
511	0	0	9	100	7	19	5	150	1	51	3	12	8	165	10	43	2	78	4	10	6	138	0	0	-1
511	-1