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	1	35	4	5	487	87.44	4895.53	
r_0t	x_ijt	q_it	and_so_on
1622	0	0	8	13	0	0	-1
1622	0	0	30	85	27	48	10	158	12	16	7	98	26	32	22	30	17	20	0	0	21	16	29	63	3	63	1	36	28	142	6	60	35	58	13	28	32	21	0	0	25	94	33	46	16	92	23	142	4	34	11	50	0	0	20	44	34	78	2	98	24	180	14	87	0	0	8	13	18	122	19	21	31	65	5	116	15	42	9	99	0	0	-1
1622	-1