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