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	5	401	107.92	26332.9	
r_0t	x_ijt	q_it	and_so_on
1336	-1
1336	0	0	17	62	8	134	20	164	21	36	0	0	15	184	19	96	25	114	0	0	14	49	23	54	22	44	13	88	4	160	0	0	9	148	16	150	0	0	2	65	3	33	7	100	12	162	0	0	-1
1336	0	0	9	74	0	0	1	60	6	207	8	67	18	54	0	0	14	98	5	36	3	66	7	50	2	130	0	0	10	154	11	66	24	144	0	0	-1
1336	0	0	9	74	0	0	17	62	1	95	6	69	16	150	0	0	15	92	13	88	22	22	23	54	19	96	0	0	21	108	25	114	4	160	0	0	-1
1336	0	0	16	75	11	66	10	154	0	0	3	66	5	36	14	98	22	44	13	44	15	92	0	0	2	130	7	100	12	162	0	0	9	74	24	96	0	0	20	164	1	85	8	134	18	18	0	0	-1
1336	0	0	4	80	15	92	13	44	23	27	19	96	25	57	0	0	9	74	24	48	0	0	-1