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	40	1	1	3139	57.12	14144.7	
r_0t	x_ijt	q_it	and_so_on
2093	-1
2093	0	0	36	180	40	112	35	64	8	92	25	128	14	84	9	130	24	110	11	136	17	114	5	38	26	74	15	118	13	82	30	120	10	73	28	20	19	76	21	46	39	116	7	87	12	114	38	88	27	30	20	112	1	86	6	76	22	81	29	50	33	78	32	56	0	0	-1
2093	0	0	22	81	2	79	31	66	23	54	16	54	34	135	18	18	8	92	25	64	37	11	4	156	3	47	32	56	0	0	-1