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	25	1	1	1711	58.42	7158.52	
r_0t	x_ijt	q_it	and_so_on
1141	-1
1141	0	0	22	88	21	36	18	24	9	182	8	59	6	118	11	94	10	64	24	82	16	182	25	50	23	90	1	112	20	68	14	23	19	44	12	126	4	66	3	17	2	88	7	53	0	0	-1
1141	0	0	8	118	9	91	2	176	7	106	3	34	13	63	15	111	4	33	17	231	14	46	20	34	5	36	23	45	0	0	-1
1141	0	0	11	94	10	64	24	246	16	182	25	50	0	0	-1
1141	0	0	7	106	2	176	3	34	4	66	13	21	15	37	12	126	19	44	17	84	14	46	23	90	1	112	20	68	5	12	16	91	10	32	6	118	8	118	9	182	18	24	21	36	22	88	0	0	-1
1141	-1