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	1	20	4	5	300	28.21	5218.88	
r_0t	x_ijt	q_it	and_so_on
999	0	0	5	58	4	98	12	53	10	68	20	23	0	0	-1
999	0	0	20	23	17	74	7	32	14	158	3	13	0	0	15	130	11	170	0	0	13	138	6	78	0	0	16	108	2	58	19	21	4	98	0	0	8	26	18	56	9	114	1	36	10	68	0	0	-1
999	-1