Inventory Routing Problem - Instances From Archetti et al. (2007)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
1	2	25	3	4	501	97.54	12817	
r_0t	x_ijt	q_it	and_so_on
1336	-1
1336	0	0	24	96	21	72	4	160	11	33	16	140	0	0	25	114	19	96	6	138	8	67	18	36	0	0	5	18	14	98	23	54	22	44	13	88	15	184	0	0	2	130	3	66	7	100	12	81	10	124	0	0	-1
1336	0	0	17	93	20	126	1	120	8	134	0	0	9	222	0	0	-1
1336	0	0	9	74	11	99	16	160	0	0	12	243	10	184	0	0	17	31	20	202	19	96	15	92	4	80	0	0	2	65	7	100	3	33	5	54	14	49	23	27	22	22	13	88	25	57	0	0	-1
1336	0	0	4	160	15	184	25	114	0	0	2	130	7	50	3	66	14	98	22	44	23	54	19	48	0	0	21	72	1	120	6	138	8	134	18	36	0	0	24	96	0	0	-1
1336	-1