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	25	1	4	428	103.94	18925.9	
r_0t	x_ijt	q_it	and_so_on
1141	0	0	8	59	0	0	-1
1141	0	0	16	182	24	82	10	64	11	94	0	0	4	66	13	42	15	74	12	126	19	44	14	46	0	0	23	90	1	112	20	68	5	24	25	50	0	0	6	59	9	124.04	2	88	3	34	7	106	0	0	-1
1141	0	0	2	176	17	231	0	0	8	118	9	148.96	18	24	21	36	22	88	0	0	-1
1141	0	0	23	90	20	68	1	112	0	0	25	50	16	91	24	246	0	0	11	94	10	32	6	177	0	0	7	53	3	17	4	66	13	42	15	74	12	126	14	23	0	0	-1
1141	0	0	1	56	20	34	5	36	16	182	10	64	11	47	0	0	21	36	18	24	9	182	8	118	0	0	22	88	2	176	7	106	0	0	23	45	14	46	17	154	19	44	12	63	4	33	3	34	0	0	-1
1141	-1