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	20	5	5	345	61.51	15612.6	
r_0t	x_ijt	q_it	and_so_on
1150	-1
1150	0	0	4	198	10	120	0	0	18	84	8	107.5	3	107.5	1	40	0	0	19	184	0	0	11	72	20	142	12	128	0	0	2	116	16	87	14	102	0	0	-1
1150	0	0	15	237	4	99	0	0	17	135	19	92	0	0	9	207	6	69	2	58	0	0	1	20	3	69.5	7	114	12	64	20	71	0	0	5	106.5	18	42	13	48	8	69.5	14	51	0	0	-1
1150	0	0	6	207	10	120	0	0	16	261	11	72	0	0	-1
1150	0	0	19	184	0	0	17	45	13	16	7	38	15	79	12	128	11	36	0	0	4	198	20	142	0	0	9	69	10	60	1	40	3	118	2	58	0	0	5	37.5	18	84	8	118	14	102	0	0	-1
1150	-1