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	4	3	1355	134.85	5964.22	
r_0t	x_ijt	q_it	and_so_on
2711	-1
2711	0	0	21	60	45	68	18	114	44	58	13	66	3	122	35	124	12	24	41	102	34	132	9	54	19	128	7	30	37	126	27	128	0	0	46	24	1	72	22	73	20	116	29	122	30	22	50	79	2	84	10	158	4	44	39	66	8	128	31	61	43	44	6	16	23	70	36	66	49	36	32	65	0	0	5	120	40	128	17	198	26	134	42	96	14	140	0	0	-1
2711	0	0	15	234	47	13	24	98	33	85	28	78	48	94	11	66	38	73	25	207	16	49	45	68	21	60	0	0	-1