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