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	5	330	63.17	21377.9	
r_0t	x_ijt	q_it	and_so_on
1101	-1
1101	0	0	13	94	3	182	0	0	12	40	8	110	6	39	9	42	15	46	11	53	0	0	1	24	2	182	4	90	0	0	19	160	7	15	17	142	0	0	5	174	14	144	0	0	-1
1101	0	0	18	176	0	0	10	184	7	30	0	0	20	174	16	114	0	0	-1
1101	0	0	2	182	4	90	16	58	0	0	17	142	19	86	0	0	3	165	6	117	0	0	13	94	11	151	0	0	14	144	15	46	9	42	8	55	12	40	0	0	-1
1101	0	0	12	20	8	110	9	21	3	108	17	71	0	0	13	47	1	31	2	91	4	45	20	116	0	0	18	176	19	154	0	0	10	184	7	30	0	0	5	235	14	72	15	23	0	0	-1
1101	-1