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	5	401	90.88	14844.1	
r_0t	x_ijt	q_it	and_so_on
1336	-1
1336	0	0	11	66	14	98	5	18	3	66	7	100	0	0	2	130	12	162	10	109	0	0	1	120	6	138	8	134	0	0	13	88	22	44	23	54	19	96	25	114	0	0	4	160	15	184	21	36	0	0	-1
1336	0	0	17	93	20	185	8	67	18	54	0	0	24	144	16	225	0	0	9	222	0	0	-1
1336	0	0	24	48	21	108	25	57	4	80	0	0	10	199	0	0	16	75	15	92	13	88	22	22	23	27	19	96	0	0	2	65	7	100	3	33	5	54	14	98	0	0	-1
1336	0	0	15	184	22	44	23	54	14	49	3	66	0	0	11	66	4	160	19	48	25	114	0	0	9	148	17	62	8	134	18	36	0	0	20	143	6	138	1	120	0	0	2	130	7	50	12	162	0	0	-1
1336	-1