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