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