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