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	50	5	1	4026	111.31	4416.37	
r_0t	x_ijt	q_it	and_so_on
2684	-1
2684	0	0	33	37	41	61	8	20	40	66	1	21	24	194	27	110	34	160	7	168	25	168	14	17	39	39	5	146	6	85	10	102	46	24	15	190	2	50	16	37	21	50	19	66	17	64	30	112	23	38	43	71	28	27	37	98	35	75	9	106	47	26	11	80	29	192	3	74	18	24	38	86	22	44	36	32	12	13	48	70	42	96	20	140	13	78	49	43	4	50	31	76	44	114	26	36	50	192	32	158	45	0	0	0	-1
2684	0	0	33	74	45	83	0	0	-1