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	5	1	1086	30.71	5093.58	
r_0t	x_ijt	q_it	and_so_on
724	-1
724	0	0	10	57	7	28	8	172	12	28	11	30	13	110	2	194	5	186	14	16	4	42	6	26	3	36	1	34	15	55	9	72	0	0	-1
724	0	0	1	68	3	72	15	110	9	144	0	0	-1
724	0	0	10	155	7	84	8	86	13	55	11	90	2	192	5	93	4	42	6	26	14	48	0	0	-1
724	0	0	8	172	12	28	13	110	2	99	5	186	4	84	6	13	3	72	1	68	15	110	9	144	0	0	-1
724	-1