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