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