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	3	4	355	53.32	18065.7	
r_0t	x_ijt	q_it	and_so_on
947	-1
947	0	0	20	130	3	150	12	42	0	0	15	102	4	54	8	114	13	64	0	0	9	90	6	143	7	54	16	40	0	0	5	61	10	152	19	82	0	0	-1
947	0	0	17	39	12	84	2	148	0	0	1	16	11	88	18	193	19	41	14	17	0	0	-1
947	0	0	13	64	8	114	3	75	20	65	1	16	0	0	16	40	7	54	6	253	0	0	14	17	5	183	9	90	0	0	-1
947	0	0	8	57	4	54	15	102	12	84	17	26	0	0	2	148	20	130	1	32	0	0	11	88	3	150	18	67	0	0	19	82	10	152	7	27	9	45	14	34	0	0	-1
947	0	0	13	64	0	0	-1