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	5	4	240	10.1	7364.5	
r_0t	x_ijt	q_it	and_so_on
639	0	0	6	39	10	96	7	89	0	0	-1
639	0	0	4	55	1	78	3	26	0	0	2	140	9	77	0	0	8	178	0	0	-1
639	0	0	10	192	0	0	7	178	0	0	6	78	5	47	4	110	0	0	-1
639	0	0	5	141	0	0	2	240	0	0	9	231	0	0	8	178	0	0	-1
639	0	0	4	110	1	117	0	0	3	26	10	192	0	0	6	78	0	0	7	178	0	0	-1
639	0	0	8	89	0	0	-1