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	3	570	88.08	9072.24	
r_0t	x_ijt	q_it	and_so_on
1141	-1
1141	0	0	14	46	17	154	3	17	4	66	12	126	19	44	5	24	20	48	23	45	0	0	25	50	16	182	24	164	10	64	11	94	0	0	8	59	9	182	2	176	7	106	0	0	-1
1141	0	0	6	59	8	118	9	91	18	24	21	36	22	88	0	0	23	90	1	168	20	54	15	111	13	63	3	34	0	0	-1
1141	0	0	7	74	2	176	13	21	4	66	17	154	14	46	0	0	25	50	16	173	10	32	11	94	6	177	0	0	-1
1141	0	0	23	90	1	112	20	68	5	36	16	100	24	164	0	0	22	88	21	36	18	24	9	182	8	118	10	64	0	0	14	23	19	44	12	189	15	74	4	33	3	34	2	88	7	85	0	0	-1
1141	-1