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