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	2	785	83.83	8611.56	
r_0t	x_ijt	q_it	and_so_on
1047	-1
1047	0	0	13	138	20	46	10	136	8	26	11	170	15	130	3	134	0	0	6	39	16	54	4	63	19	42	2	66	1	36	9	114	18	53	14	158	7	32	17	128	0	0	-1
1047	0	0	10	68	12	159	4	126	2	132	16	108	5	96	6	78	0	0	-1
1047	0	0	20	23	8	26	17	168	9	57	18	159	14	158	7	96	11	85	0	0	3	134	15	130	13	138	0	0	-1
1047	0	0	6	78	5	96	16	108	2	132	19	42	4	126	12	106	13	69	0	0	3	67	15	65	11	170	8	13	14	79	9	114	1	54	10	136	20	46	0	0	-1
1047	-1