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	
2	6	50	7	3	1291	391.78	33970.8	
r_0t	x_ijt	q_it	and_so_on
2583	-1
2583	0	0	16	22	28	32	33	58	36	146	17	154	32	34	49	184	47	15	20	188	19	120	27	74	4	176	0	0	5	34	38	150	9	34	6	86	48	44	30	114	12	28	2	74	39	51	10	86	40	120	44	22	15	80	8	82	34	19	13	102	26	130	0	0	11	36	18	48	41	82	46	26	23	152	31	64	29	152	43	154	3	136	21	60	0	0	-1
2583	0	0	37	80	14	92	0	0	11	18	18	96	26	65	25	48	50	80	13	51	34	38	22	228	24	291	1	237	9	17	38	75	35	24	5	17	0	0	45	69	42	282	8	164	7	126	15	40	44	44	40	60	10	172	39	102	2	148	12	14	48	22	6	43	0	0	-1
2583	0	0	14	276	43	100.92	29	152	31	64	23	152	46	26	45	23	41	246	37	80	0	0	21	60	3	136	16	11	28	32	33	58	36	146	32	34	17	154	47	45	20	188	19	120	27	37	4	176	0	0	-1
2583	0	0	1	158	12	28	2	148	39	102	10	172	40	120	44	44	15	80	7	42	8	164	42	94	31	32	23	76	46	13	0	0	45	23	29	76	43	130.08	24	194	22	152	34	38	13	102	50	80	25	48	26	65	18	96	11	36	37	160	0	0	5	34	35	24	38	150	9	34	6	86	30	114	48	44	49	184	32	17	17	77	20	94	19	60	27	74	4	88	33	29	28	16	16	22	3	68	21	30	0	0	-1
2583	-1