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	35	1	3	922	82.01	4080.6	
r_0t	x_ijt	q_it	and_so_on
1844	-1
1844	0	0	23	47	4	112	24	104	34	168	19	12	21	11	10	54	15	12	9	99	14	29	17	132	16	106	11	36	0	0	31	68	22	66	30	146	26	76	12	34	32	114	5	121	20	35	3	68	29	130	7	64	0	0	6	134	18	90	35	59	2	23	8	33	13	112	27	174	1	114	28	104	25	38	33	41	0	0	-1
1844	-1