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	4	539	98.73	24428.1	
r_0t	x_ijt	q_it	and_so_on
1437	-1
1437	0	0	14	121	16	118	15	112	21	108	5	46	0	0	6	158	23	198	7	47	24	28	9	58	3	49	0	0	13	134	17	150	0	0	-1
1437	0	0	16	59	12	294	14	107	6	79	0	0	2	42	11	19	20	40	21	54	10	93	25	126	22	90	17	75	0	0	3	98	9	116	19	222	0	0	24	14	7	94	18	69	8	150	4	87	15	56	1	64	0	0	-1
1437	0	0	13	67	1	91	20	120	5	23	11	57	2	126	0	0	10	31	25	226	22	270	0	0	-1
1437	0	0	5	46	21	108	1	101	13	134	17	150	0	0	23	198	24	28	7	94	18	46	14	152	0	0	15	112	4	61	8	150	12	98	16	118	0	0	6	158	3	98	9	116	19	148	0	0	-1
1437	-1