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