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