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