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