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