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	
2	1	35	1	5	553	84.2	13142.4	
r_0t	x_ijt	q_it	and_so_on
1844	-1
1844	0	0	2	23	8	33	24	104	34	168	19	12	21	11	10	54	15	20	9	99	14	29	0	0	23	94	4	112	35	118	18	90	6	134	0	0	7	64	29	130	31	68	11	36	16	106	17	149	0	0	22	66	30	98	26	76	12	34	32	114	5	89	20	35	33	41	0	0	13	112	27	174	1	57	28	104	25	38	3	68	0	0	-1
1844	-1