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