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	4	1	1155	28.05	5339.99	
r_0t	x_ijt	q_it	and_so_on
770	-1
770	0	0	15	164	2	196	7	84	1	22	13	20	6	24	11	72	14	102	9	118	5	188	0	0	-1
770	0	0	7	42	8	51	1	11	10	81	13	10	3	255	12	201	11	114	4	159	14	51	2	98	15	82	0	0	-1
770	0	0	5	188	9	118	0	0	-1
770	0	0	5	94	9	59	15	164	2	196	14	102	4	53	11	124	12	67	3	102	6	24	13	20	10	27	1	22	8	17	7	84	0	0	-1
770	-1