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