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	2	1002	93.11	20144.2	
r_0t	x_ijt	q_it	and_so_on
1336	-1
1336	0	0	16	150	4	160	15	184	13	88	22	44	23	54	14	49	3	33	7	100	2	65	0	0	9	148	17	62	18	36	8	134	1	60	6	138	20	82	19	96	25	114	21	36	24	96	0	0	-1
1336	0	0	16	75	11	66	14	98	5	36	3	66	7	50	2	130	12	162	10	231	0	0	-1
1336	0	0	21	72	25	114	19	96	23	54	22	44	13	88	15	184	4	160	0	0	9	148	17	62	20	246	1	60	8	134	18	36	0	0	-1
1336	0	0	9	74	8	67	6	207	1	120	17	31	24	144	0	0	16	150	11	66	14	98	5	36	3	66	7	100	2	130	12	162	10	77	0	0	-1
1336	0	0	4	80	15	92	13	88	22	22	23	27	19	96	25	57	21	36	9	74	0	0	-1