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	5	809	477.38	18044.2	
r_0t	x_ijt	q_it	and_so_on
2696	-1
2696	0	0	17	198	2	68	10	158	4	82	50	158	30	22	29	122	0	0	49	18	23	70	6	32	43	44	31	122	39	66	8	128	26	134	42	192	0	0	32	130	36	66	16	49	44	58	13	66	3	34	35	124	12	24	41	102	34	132	0	0	27	128	37	126	7	30	19	128	9	54	18	114	45	68	21	60	0	0	46	24	1	72	22	146	20	116	40	128	5	156	0	0	-1
2696	0	0	21	120	25	207	24	196	36	33	49	36	14	210	0	0	45	136	38	73	11	132	48	188	28	156	33	85	47	39	0	0	15	234	0	0	-1
2696	0	0	37	126	27	128	0	0	5	78	40	64	17	198	30	22	29	122	20	58	22	146	1	72	46	24	0	0	14	70	26	67	2	68	10	158	8	128	39	66	31	122	43	44	23	70	0	0	16	147	25	69	38	219	33	255	36	33	0	0	18	114	44	58	13	66	3	34	35	124	12	24	41	102	34	132	9	54	19	64	7	30	0	0	-1
2696	0	0	27	64	7	15	19	128	9	27	34	66	41	51	3	17	35	62	13	33	11	132	25	69	45	136	0	0	49	36	6	32	23	35	28	156	48	188	24	196	36	33	47	13	21	120	0	0	15	156	32	130	42	192	40	128	5	156	0	0	26	134	10	79	8	64	39	33	4	123	50	158	30	11	29	61	20	116	0	0	-1
2696	-1