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