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	3	668	103.3	10938.3	
r_0t	x_ijt	q_it	and_so_on
1336	-1
1336	0	0	3	66	5	18	14	98	23	54	22	44	13	44	15	184	4	160	0	0	21	72	25	114	19	96	6	138	8	100	9	148	0	0	10	77	12	162	7	100	2	130	11	66	16	133	0	0	-1
1336	0	0	18	54	8	101	1	120	20	164	17	93	24	48	0	0	-1
1336	0	0	9	148	24	144	0	0	4	80	14	98	5	54	3	33	7	100	2	65	10	231	0	0	25	57	19	96	23	27	22	22	13	132	15	92	16	167	0	0	-1
1336	0	0	11	99	4	160	15	184	25	114	21	108	0	0	17	62	1	120	20	164	6	138	8	134	18	36	0	0	12	162	2	130	7	50	3	66	14	49	23	54	22	44	13	44	19	48	0	0	-1
1336	-1