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	4	4	686	108.25	4554.43	
r_0t	x_ijt	q_it	and_so_on
1830	-1
1830	0	0	18	84	34	61	1	66	36	120	38	53	33	74	29	146	32	14	19	68	0	0	12	42	15	58	2	32	27	58	39	50	6	64	23	84	13	92	16	98	31	108	0	0	4	90	26	86	3	142	24	10	37	34	30	62	20	30	14	78	35	118	17	36	0	0	28	11	22	26	21	64	10	170	5	94	40	28	9	53	25	98	8	142	0	0	-1
1830	0	0	7	144	11	65	0	0	-1