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	20	4	1	1570	41.21	14484.4	
r_0t	x_ijt	q_it	and_so_on
1047	-1
1047	0	0	3	134	15	130	11	170	8	26	14	158	7	64	17	148	18	106	9	114	1	36	19	42	2	103	16	54	4	63	12	0	10	68	20	46	13	69	6	39	0	0	-1
1047	0	0	6	78	5	96	16	108	2	95	4	126	12	159	10	136	13	138	0	0	-1
1047	0	0	3	134	15	130	11	90	14	158	7	64	18	106	9	114	17	148	8	26	20	46	0	0	-1
1047	0	0	3	67	15	65	11	165	8	13	7	32	14	79	18	53	9	57	1	54	19	42	2	132	16	108	5	96	4	126	12	106	10	136	20	23	13	138	6	78	0	0	-1
1047	-1