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	15	1	5	272	27.97	9298.26	
r_0t	x_ijt	q_it	and_so_on
907	-1
907	0	0	4	176	1	64	0	0	13	110	15	146	0	0	7	170	11	102	0	0	9	44	8	79	3	102	0	0	14	130	12	92	0	0	-1
907	0	0	9	22	6	30	13	55	12	46	1	32	0	0	2	226	0	0	5	272	0	0	4	88	10	94	14	65	0	0	8	158	0	0	-1
907	0	0	7	170	0	0	5	120	0	0	11	170	0	0	-1
907	0	0	13	110	15	152	6	10	0	0	8	158	9	44	0	0	1	64	4	176	0	0	2	170	3	102	0	0	12	92	10	50	14	130	0	0	-1
907	0	0	7	85	0	0	-1