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	40	5	5	657	118.71	14948.1	
r_0t	x_ijt	q_it	and_so_on
2191	-1
2191	0	0	38	42	19	124	13	77	3	19	31	40	30	162	4	43	6	120	0	0	15	156	33	134	24	110	40	120	5	56	16	52	37	19	0	0	27	72	21	156	28	11	36	50	35	62	23	100	10	118	11	34	14	48	0	0	18	100	34	192	17	130	39	148	0	0	25	26	2	85	9	38	32	118	20	124	29	178	1	88	0	0	-1
2191	0	0	8	64	7	35	1	88	37	19	12	68	22	294	26	60	0	0	-1