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