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	2	4	983	421.56	15991.8	
r_0t	x_ijt	q_it	and_so_on
2620	-1
2620	0	0	3	26	21	160	40	37	20	68	4	70	10	44	23	134	48	104	12	22	50	88	22	41	5	178	0	0	17	108	42	98	26	38	31	160	28	178	35	72	41	60	34	38	37	162	13	21	47	11	0	0	24	198	33	184	11	76	44	128	18	66	9	126	7	114	0	0	27	164	15	88	14	170	30	20	2	134	8	164	45	78	19	74	0	0	-1
2620	0	0	3	13	16	222	10	88	4	140	39	63	43	48	48	52	12	11	50	44	22	82	1	204	0	0	47	22	25	117	32	111	36	66	38	41	28	89	6	116	31	80	26	76	42	196	0	0	27	82	15	44	14	85	2	67	46	33	29	240	40	74	8	82	49	177	45	39	19	37	0	0	-1
2620	0	0	24	198	18	66	44	128	9	126	7	114	0	0	11	76	13	63	37	162	34	114	41	60	38	123	36	198	33	184	0	0	-1
2620	0	0	47	22	24	99	25	39	33	92	5	178	42	196	22	82	1	68	17	108	0	0	7	57	9	63	41	30	35	72	28	178	6	116	31	160	12	22	50	88	26	76	32	37	11	38	18	33	0	0	27	164	15	88	14	85	49	59	30	20	2	134	8	164	21	160	19	74	0	0	45	78	46	11	40	74	20	68	29	122.72	10	88	4	140	39	21	43	32	23	134	48	104	16	74	3	26	0	0	-1
2620	-1