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	30	3	5	568	47.19	5026.34	
r_0t	x_ijt	q_it	and_so_on
1894	-1
1894	0	0	2	98	25	68	3	54	18	142	19	100	9	98	0	0	23	95	16	146	21	66	27	168	1	82	0	0	11	66	20	108	14	130	17	138	10	122	0	0	6	64	24	60	22	64	8	55	29	198	7	120	0	0	30	122	0	0	-1
1894	0	0	15	43	5	57	13	144	12	99	28	80	4	48	26	92	0	0	-1