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