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	45	5	1	3525	92.43	3746.98	
r_0t	x_ijt	q_it	and_so_on
2350	0	0	26	85	31	80	0	0	-1
2350	0	0	28	20	33	39	9	178	6	96	40	70	21	51	27	84	13	134	25	146	1	110	12	122	29	106	20	120	8	11	35	190	37	64	18	84	7	36	11	20	44	97	24	50	17	19	34	34	16	50	15	62	4	110	39	66	3	50	23	74	41	100	36	37	5	13	14	192	30	102	22	176	42	44	32	26	10	162	38	48	43	38	45	168	19	74	2	52	0	0	-1
2350	-1