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	25	5	5	431	100.56	26725.5	
r_0t	x_ijt	q_it	and_so_on
1437	-1
1437	0	0	23	198	9	116	3	98	0	0	15	56	12	98	22	111.4	10	62	21	61.2	5	23	11	19	0	0	4	37	8	75	18	46	7	94	24	28	19	148	0	0	13	134	17	150	0	0	6	158	14	152	16	118	0	0	-1
1437	0	0	2	84	5	23	20	80	15	112	6	79	0	0	1	64	21	100.8	25	264	0	0	-1
1437	0	0	4	111	8	225	7	47	24	28	0	0	11	57	1	192	13	67	0	0	16	59	12	294	14	76	0	0	17	150	3	49	9	58	19	148	0	0	22	248.6	25	88	10	62	5	23	0	0	-1
1437	0	0	21	108	15	112	18	69	7	94	24	14	0	0	6	158	14	152	16	118	0	0	17	75	13	134	20	80	5	46	2	84	0	0	3	98	9	116	23	198	0	0	-1
1437	-1