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	10	3	5	142	10.53	9372.89	
r_0t	x_ijt	q_it	and_so_on
475	-1
475	0	0	4	78	0	0	1	110	0	0	8	42	2	61	5	28	0	0	6	112	3	22	0	0	10	51	9	64	0	0	-1
475	0	0	2	122	5	14	0	0	7	117	0	0	10	142	0	0	6	142	0	0	-1
475	0	0	6	142	0	0	1	142	0	0	9	64	8	42	0	0	4	142	0	0	-1
475	0	0	3	22	5	28	0	0	2	122	0	0	10	127	0	0	-1
475	0	0	7	117	8	21	0	0	6	99	0	0	-1