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	
2	2	25	3	4	501	111.57	23322.3	
r_0t	x_ijt	q_it	and_so_on
1336	-1
1336	0	0	8	81	6	138	23	54	22	44	13	88	19	96	0	0	2	130	7	100	3	66	5	36	14	98	11	66	0	0	24	96	16	150	12	92	10	154	0	0	21	36	25	114	15	184	4	160	0	0	-1
1336	0	0	9	222	0	0	17	93	20	145	1	60	8	120	18	54	0	0	-1
1336	0	0	10	154	12	232	7	50	2	65	0	0	3	33	14	49	23	54	22	44	13	88	19	96	25	114	0	0	4	160	15	184	21	72	9	74	0	0	1	180	6	138	20	183	0	0	-1
1336	0	0	11	66	14	98	5	36	3	66	7	100	2	130	0	0	24	144	17	62	8	134	18	18	9	74	0	0	16	225	0	0	-1
1336	0	0	4	80	15	92	13	88	22	22	23	27	19	96	25	57	21	36	0	0	-1