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	40	1	2	1570	90.91	4370.46	
r_0t	x_ijt	q_it	and_so_on
2093	0	0	35	32	36	90	0	0	-1
2093	0	0	35	32	4	52	25	128	8	184	18	18	28	20	39	116	21	46	7	87	12	114	38	88	27	30	20	112	1	86	6	38	31	66	2	79	22	162	40	112	0	0	33	78	29	50	23	36	16	54	34	90	19	76	10	73	30	120	13	82	15	118	26	74	5	38	17	114	11	136	24	55	9	122	14	84	37	11	3	47	32	112	0	0	-1
2093	-1