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	3	570	123.98	17844.4	
r_0t	x_ijt	q_it	and_so_on
1141	0	0	9	91	0	0	-1
1141	0	0	16	182	24	90.2	10	64	11	94	6	118	0	0	17	154	20	68	1	112	23	90	25	50	0	0	14	46	19	22	12	126	15	74	4	66	3	17	7	53	2	88	22	0	8	59	0	0	-1
1141	0	0	1	56	20	34	5	36	12	63	13	63	4	33	3	34	2	176	7	53	0	0	22	88	21	36	18	24	9	182	8	118	0	0	-1
1141	0	0	7	53	13	21	15	74	12	63	19	66	17	154	14	46	23	90	0	0	11	94	10	32	24	237.8	16	107.8	25	50	0	0	-1
1141	0	0	23	45	1	112	20	68	5	24	16	165.2	10	64	11	47	0	0	6	118	8	118	9	182	18	24	21	36	22	88	0	0	7	106	2	176	3	34	4	66	17	77	14	23	0	0	-1
1141	-1