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	2	680	45.24	6099.01	
r_0t	x_ijt	q_it	and_so_on
907	-1
907	0	0	7	170	9	44	8	124.666	5	196	0	0	1	64	4	176	14	130	10	72	12	92	13	110	0	0	-1
907	0	0	2	297	3	144.333	8	112.333	0	0	11	68	1	32	4	88	14	65	12	46	13	55	15	219	6	30	9	22	0	0	-1
907	0	0	7	170	11	204	5	196	0	0	-1
907	0	0	9	44	6	10	15	73	13	110	12	92	10	72	14	130	1	64	7	85	0	0	11	6	4	176	2	99	3	59.666	8	158	5	0	0	0	-1
907	-1