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	20	4	3	523	70.1	10359.6	
r_0t	x_ijt	q_it	and_so_on
1047	-1
1047	0	0	13	138	20	23	11	85	15	130	3	134	0	0	5	96	16	108	4	126	12	106	10	87	0	0	8	13	14	80	18	106	9	57	1	36	19	21	2	132	6	78	0	0	-1
1047	0	0	10	117	9	114	17	222	20	46	0	0	8	26	7	96	14	157	11	170	15	65	0	0	-1
1047	0	0	16	78	2	132	19	63	4	126	12	106	0	0	6	39	13	138	3	134	0	0	-1
1047	0	0	15	130	11	170	8	26	20	46	13	69	0	0	10	136	4	63	2	66	16	84	5	96	6	78	0	0	17	77	7	32	14	158	18	106	9	114	1	36	0	0	-1
1047	-1