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	30	4	5	487	63.68	4959.88	
r_0t	x_ijt	q_it	and_so_on
1624	0	0	3	63	0	0	-1
1624	0	0	20	39	4	31	5	146	21	41	16	128	2	102	0	0	27	49	28	26	12	198	18	64	8	17	25	116	24	17	0	0	9	32	23	126	15	168	30	158	0	0	19	93	10	96	29	198	14	100	0	0	11	55	13	182	17	35	26	60	7	17	6	106	1	32	0	0	-1
1624	0	0	27	98	20	39	4	62	22	70	3	126	0	0	-1