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