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