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	1	5	692	144.21	5472.9	
r_0t	x_ijt	q_it	and_so_on
2308	-1
2308	0	0	38	66	43	83	10	60	42	81	17	22	44	198	21	90	28	92	0	0	40	44	12	112	9	32	36	174	2	90	11	66	6	148	24	26	0	0	23	44	35	54	22	86	1	91	30	144	4	68	37	32	33	15	15	64	34	94	0	0	32	10	26	79	14	90	31	24	7	15	25	28	27	156	16	180	8	10	5	64	3	36	0	0	19	58	39	136	45	48	20	71	18	88	29	72	41	180	13	39	0	0	-1
2308	-1