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	2	5	634	135.13	6115.9	
r_0t	x_ijt	q_it	and_so_on
2114	-1
2114	0	0	39	52	13	136	41	80	16	160	36	148	26	58	0	0	30	88	1	82	22	77	15	108	42	41	5	29	29	126	24	32	0	0	18	76	37	63	9	82	31	76	7	40	25	35	4	20	12	24	20	24	14	160	40	34	0	0	27	114	38	66	10	20	43	126	21	80	19	17	3	26	44	99	35	44	33	42	0	0	11	32	8	20	34	85	2	160	45	78	17	26	23	70	28	93	32	22	6	48	0	0	-1
2114	-1