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	1	25	5	2	1175	35.7	4208	
r_0t	x_ijt	q_it	and_so_on
1566	-1
1566	0	0	19	148	3	136	9	116	23	99	24	28	7	94	18	46	14	152	16	118	6	158	0	0	13	134	15	112	21	108	1	64	20	40	5	186	0	0	-1
1566	0	0	2	44	11	19	10	93	25	264	22	90	4	75	8	75	12	98	16	0	17	75	0	0	-1