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	
2	2	20	1	4	413	72.46	19051.8	
r_0t	x_ijt	q_it	and_so_on
1101	-1
1101	0	0	19	80	7	30	11	102	17	142	0	0	3	182	6	39	9	42	8	110	12	40	0	0	1	12	2	182	4	90	20	86	16	43	0	0	5	129	14	144	15	46	13	94	0	0	-1
1101	0	0	10	184	0	0	19	160	18	176	0	0	-1
1101	0	0	12	40	6	117	9	42	8	55	2	91	1	36	0	0	4	90	20	146	16	129	0	0	5	219	13	94	0	0	7	29	11	102	14	72	15	46	3	91	0	0	-1
1101	0	0	12	20	9	21	8	110	2	182	4	45	0	0	19	160	18	176	0	0	13	47	14	144	15	23	3	182	0	0	17	213	10	184	7	16	0	0	-1
1101	-1