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	
1	2	25	5	5	431	96.33	15244.7	
r_0t	x_ijt	q_it	and_so_on
1437	-1
1437	0	0	23	99	24	28	7	94	18	23	8	75	12	98	0	0	3	98	9	116	19	148	0	0	13	67	15	112	21	108	1	64	0	0	4	37	22	180	25	130.6	10	31	5	46	0	0	6	158	14	152	16	118	0	0	-1
1437	0	0	20	80	11	29.8	2	126	0	0	13	134	17	225	0	0	-1
1437	0	0	3	49	9	58	24	14	7	47	18	69	23	99	6	79	0	0	2	42	11	46.2	5	23	1	192	0	0	4	111	8	225	14	76	0	0	15	56	25	221.4	10	93	21	54	0	0	12	294	16	59	17	75	0	0	-1
1437	0	0	21	108	22	180	15	112	0	0	16	118	14	152	6	158	0	0	23	198	7	94	24	28	3	98	0	0	9	116	19	222	0	0	13	134	20	80	5	46	0	0	-1
1437	-1