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