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	2	785	117.02	15741.1	
r_0t	x_ijt	q_it	and_so_on
1047	-1
1047	0	0	6	39	5	48	16	108	2	132	19	21	4	126	12	106	10	136	13	69	0	0	20	23	1	36	9	114	18	53	14	158	7	64	17	76	8	26	11	170	15	65	0	0	-1
1047	0	0	6	78	13	138	20	46	15	130	3	201	0	0	-1
1047	0	0	8	26	17	220	9	73	18	159	14	158	7	64	11	85	0	0	5	144	16	54	2	132	19	63	4	126	12	106	10	136	13	24	0	0	-1
1047	0	0	6	78	16	108	4	63	2	66	1	54	9	98	14	79	7	32	17	74	10	68	0	0	3	134	15	130	11	170	8	13	20	46	13	114	0	0	-1
1047	-1