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