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	4	969	470.18	35663.7	
r_0t	x_ijt	q_it	and_so_on
2583	-1
2583	0	0	43	77	42	188	8	82	15	80	44	22	40	120	10	86	39	51	2	74	12	28	48	44	30	114	0	0	11	36	18	48	13	102	34	19	22	152	31	64	29	152	23	152	46	26	45	46	41	164	0	0	28	32	36	146	32	34	17	154	47	15	49	184	6	86	9	34	38	150	5	34	0	0	4	176	27	74	19	120	20	188	33	58	16	22	3	136	21	60	0	0	-1
2583	0	0	11	18	18	96	26	195	25	48	50	120	13	51	34	38	22	76	31	32	29	76	23	76	46	13	45	23	0	0	9	17	6	43	48	22	12	14	2	148	39	102	10	172	40	60	44	44	15	40	7	126	8	164	0	0	21	30	4	88	5	17	35	24	38	75	1	237	24	291	43	154	0	0	14	253	37	160	0	0	-1
2583	0	0	4	88	27	58	19	120	20	188	47	45	17	154	32	34	36	146	33	58	28	32	16	11	0	0	3	136	0	0	-1
2583	0	0	37	160	41	164	45	46	46	26	23	152	29	152	43	154	14	115	0	0	11	36	18	96	26	65	25	48	50	40	13	102	34	38	22	95	8	164	42	188	24	97	0	0	21	60	3	68	16	22	17	77	32	17	49	184	48	44	30	114	6	86	9	34	38	150	19	60	27	53	0	0	5	34	35	24	1	111	12	28	2	148	39	102	10	172	40	120	44	44	15	80	7	42	31	64	0	0	-1
2583	-1