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	1	5	692	145.05	16109.5	
r_0t	x_ijt	q_it	and_so_on
2308	-1
2308	0	0	24	26	6	148	11	132	36	174	41	90	12	112	0	0	34	94	15	64	33	15	37	32	4	110	30	144	1	147	22	86	0	0	23	44	32	10	26	79	14	90	31	24	7	15	25	44	27	156	16	180	8	10	3	36	0	0	40	44	19	58	39	136	18	88	20	112	45	48	5	128	35	54	0	0	29	72	28	92	21	90	44	198	17	22	42	140	13	78	0	0	-1
2308	0	0	11	66	2	90	43	83	10	60	38	66	41	90	9	75	0	0	-1