Inventory Routing Problem - Instances From Archetti et al. (2012)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
1	6	50	4	4	1011	539.52	15839.7	
r_0t	x_ijt	q_it	and_so_on
2696	-1
2696	0	0	26	134	2	68	10	158	8	128	39	66	43	44	23	70	28	156	25	138	47	26	0	0	46	24	1	72	22	146	20	116	29	122	30	22	17	198	40	128	5	156	0	0	15	156	21	120	45	68	16	98	24	196	36	66	49	36	32	130	14	140	0	0	18	114	38	146	13	66	35	124	3	34	41	102	34	132	9	54	19	64	7	30	27	128	0	0	-1
2696	0	0	7	15	19	128	9	27	34	66	41	51	12	36	35	62	3	17	13	33	48	188	11	134.76	44	87	45	136	0	0	21	60	49	18	36	33	33	170	23	35	6	32	31	183	8	64	39	33	4	123	50	79	29	61	42	96	0	0	37	189	27	64	0	0	-1
2696	0	0	17	198	26	134	10	158	4	41	50	237	30	22	29	61	20	116	46	24	0	0	5	156	1	72	40	128	42	288	14	140	15	156	0	0	-1
2696	0	0	26	67	6	32	23	70	43	44	31	61	39	66	8	128	10	79	2	68	30	11	29	61	20	58	22	146	40	64	0	0	33	170	28	156	48	188	11	129.24	38	146	25	207	0	0	47	26	44	58	13	66	3	34	35	124	12	12	41	102	34	132	9	54	19	128	7	30	37	63	27	128	0	0	5	78	32	130	49	36	36	66	24	196	16	98	18	114	45	136	21	120	0	0	-1
2696	-1