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