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