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	5	314	58.16	22634.4	
r_0t	x_ijt	q_it	and_so_on
1047	-1
1047	0	0	19	21	1	36	9	61	18	106	7	64	8	26	0	0	17	148	14	158	0	0	13	138	10	136	20	23	0	0	15	130	11	170	0	0	4	63	2	71	16	54	5	48	6	78	0	0	-1
1047	0	0	20	46	9	110	14	79	15	65	0	0	3	201	0	0	16	54	2	127	4	126	0	0	12	159	13	69	0	0	-1
1047	0	0	11	170	10	136	0	0	6	78	3	67	0	0	5	144	16	54	19	63	12	53	0	0	13	69	17	148	7	64	8	26	0	0	-1
1047	0	0	15	130	14	158	8	13	0	0	3	67	0	0	9	114	18	159	0	0	2	132	1	54	4	126	0	0	13	69	20	46	10	68	16	108	0	0	-1
1047	0	0	3	67	11	85	7	64	6	39	0	0	-1