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	4	428	86.12	9872.72	
r_0t	x_ijt	q_it	and_so_on
1141	-1
1141	0	0	25	50	16	182	24	164	0	0	14	46	17	154	5	24	20	68	1	112	0	0	11	94	10	64	8	59	9	182	0	0	23	90	12	126	4	54	3	17	2	88	7	53	0	0	-1
1141	0	0	3	34	4	45	13	63	15	111	19	66	17	77	0	0	6	177	0	0	22	88	21	54	18	26	9	91	8	118	0	0	7	106	2	176	0	0	-1
1141	0	0	14	46	20	68	1	112	23	90	0	0	25	50	16	132	10	32	11	94	0	0	-1
1141	0	0	16	141	24	164	10	64	6	59	0	0	8	118	9	182	18	22	21	18	22	88	0	0	2	176	7	106	17	123	14	23	0	0	23	45	20	34	5	24	19	22	12	126	15	56	13	21	4	66	3	34	0	0	-1
1141	-1