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	5	813	171.54	18818.5	
r_0t	x_ijt	q_it	and_so_on
2711	-1
2711	0	0	5	120	40	128	42	96	49	36	36	66	24	98	25	138	16	49	47	17	32	65	0	0	18	57	44	58	38	73	11	66	13	66	3	122	35	124	12	13	41	102	34	132	0	0	27	128	37	63	7	30	19	128	9	54	45	136	21	120	15	154	0	0	17	99	26	134	10	158	2	63	29	122	20	116	22	73	1	36	46	12	0	0	14	70	30	22	50	79	4	22	39	66	8	128	31	61	43	22	6	16	23	70	28	78	48	94	33	85	0	0	-1
2711	-1