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